Imagine an infinitely large array A[0...]. In this array, A[0] = A[1] = and = A[n 1] = 0, == A[n] = A[n+ 1] = A[n+ 2] = = ... = 1. That is, the first n elements of the array are 0 and all subsequent elements are 1. In constant time we can query the array to find the value of an array element A[i]. We do not know the value of n, the index of the first nonzero element. (A) Describe an algorithm to find the value of n. This algorithm should make at most O(logn) queries. (B) Describe an algorithm for finding any index m, where A[m] c> 1. Show that this algorithm requires O(log log n) array queries. (C) Describe an algorithm for finding any m, where A[m] algorithm? = = 1 and m