Let T$[1..$n$]$ be a sorted array of distinct integers, some of which may be

negative. Call an index i an anchor if T$[$i$]=$ i$.$ Give an algorithm for finding

an anchor in T$[1..$n$]$ if one exists. Write your algorithm in pseudo$-$code and give

a recurrence on the time for your algorithm. Your algorithm should take O$($log n$)$

time.