Let T [ 1.. n ] be a sorted array of distinct integers, some of which may be negative. Design an algorithm that can find an index i such that 1 i n and T [ i ] = i , if such an index exists, else returns 1 . Design your algorithm such that its worst case efficiency is O ( lo g n ) , and prove this result. .