Given a sorted array of n distinct integers A[1], A[2], , A[n], describe an O(log n) algorithm to find out whether there is an index i such that A[i] = i. Why does your algorithm run in the claimed time bound?