def recursiveBinarySearch(arr,item,lowerBound,upperBound):
  if upperBound < lowerBound:
    return -1
  
  else:
    #note the use of // in Python
    midpoint = (_____________________)//2
  
    if item == arr[midpoint]:
      return ______________
  
    elif item > arr[midpoint]:
      lowerBound = midpoint + 1
  
    else:
      upperBound = midpoint - 1
  
    return recursiveBinarySearch(arr,item,___________,______________)