You are given an infinite array A[.] in which the first n entries contain different integers in sorted order and the rest are filled with . You are not given the value of n. Describe an algorithm that takes as an input an integer x and finds a position in the array containing x, if such position exists, in O(log(n)) time.