def binarysearch(a,n):mid=int(len(a)2) #taking the middle pointif(n==a[mid]): return midelif(n>a[mi