Question: Given as input a sorted integer array a[0] < a[1] < • • • < a[n ? 1], explain in words a divide-and- conquer algorithm that runs in O(log n) time, and that determines if there is an i for which a[i] = i. Argue that your algorithm is correct and provide supporting pseudo-code.