Given a sorted $($in increasing order$)$ array A with n distinct integers, find an index i$,$ if it exists, where$$A$[$i$]=$ i$.$ Your algorithm should run in O$($log n$)$ time. Justify the correctness of your algorithm and prove$$this upper bound on its run$-$time.