Question 3: (Binary search in an infinite phone directory) Let A1.] be an infinite array of real numbers such that 0 = A[1] A[2] x. (You may even show that such an index can be computed in O(log log n) time, but the rest of the algorithm will still take O(log n) time.)