Lets assume you get a sorted array T[1..n], containing all distinct integers (negative or positive). Give a O(log n) divide-and-conquer algorithm to find i where T[i] = i if such i exists.