Let T[1..n] be a sorted array of distinct integers, some of which may be negative. Give an algorithm that can find an index i such that 1 lessthanorequalto i lessthanorequalto n and T[i] = i, provided such an index exists. Your algorithm should take a time in O(log n) in the worst case