![def binarysearch(alist, item): if len(alist): return False 4 else: midpoint = len(alist)//2 if alist[midpoint]--item: 6 return True 8 9 10 else: if itemcalist[midpoint]: return binarysearch(alist[:midpoint],item) else: 12 return binarySearch(alist[midpoint+1:j,item) testlist = [10, 20, 30, 40, 50, 60, 70, 80, 90] print(binarySearch(testlist, 90)) 14](http://d2vlcm61l7u1fs.cloudfront.net/media%2F56d%2F56dee2d5-2daa-44e9-98e7-f2aa6e5045b7%2Fphp1M40kC.png)
Modify the Binary Search such that it uses recursion in it.
def binarysearch(alist, item): if len(alist): return False 4 else: midpoint = len(alist)//2 if alist[midpoint]–item: 6 return True 8 9 10 else: if itemcalist[midpoint]: return binarysearch(alist[:midpoint],item) else: 12 return binarySearch(alist[midpoint+1:j,item) testlist = [10, 20, 30, 40, 50, 60, 70, 80, 90] print(binarySearch(testlist, 90)) 14 Show
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured