2. You are given an infinite array Alt] in which the first n elements are integers in sorted order and the rest are filled with oo, You are not given n. Describe an algorithm that takes as input an integer r and finds a position in the array containing r, if such a position exists, in O(log n) time