Question 6: (Binary search in an infinite array) Let A[1...] be an infinite array of real numbers such that 0 = A[1] 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.) Question 7: Let A[1...n] be an array containing numbers in sorted order; you may assume that all these numbers are distinct. The following algorithm is a randomized version of the binary search algorithm. The input consists of the array A, its size n, and a number x. If x is in the array, then the algorithm returns the index p such that A[p] = r. Otherwise, the algorithm returns not present. Algorithm RANDOMIZEDBINARYSEARCH(A, n, x): I = 1; r = n; while I