You are given an infinite array A[.] in which the first n cells contain integers in sorted order and the rest of the cells are filled with [infinity]. You are not given the value of n. Describe an algorithm that takes an integer x as input and finds a position in the array containing x, if such a position exists, in O(logn) time. (Assume that the implementation of the array data type in your programming language returns the error message whenever elements A[i] with i > n are accessed.)