input: Write a python function to perform a binary search on a sorted list.
  assert binary_search([1, 3, 8, 10, 12, 15, 17, 20, 22, 34, 38, 40], 10, 0, 11) == True
  assert binary_search([1, 3, 8, 10, 12, 15, 17, 20, 22, 34, 38, 40], 21, 0, 11) == False
  assert binary_search([1, 2, 3, 4, 5, 6, 7, 8, 9], 5, 0, 8) == True
output: def binary_search(arr, target, low, high):
      if high >= low:
          mid = (high + low) // 2
          if arr[mid] == target:
              return True
          elif arr[mid] > target:
              return binary_search(arr, target, low, mid - 1)
          else:
              return binary_search(arr, target, mid + 1, high)
      else:
          return False