Design and analysis of algorithms

Problem 4. Given a sorted array of distinct integers A[1 -n], you want to find out whether there is an index i for which A[i] = i. Give a divide-and-conquer algorithm that runs in time O(og) 1