You are given an infinite array in which the first n cells contain integers in sorted order and the rest of the cells are filled with Importantly, you are not given the value of n$.$ Describe an algorithm that takes an integer as input and finds a position in the array containing if such a position exists, in logn$)$ time. $($If you are disturbed by the fact that the array A has infinite length, assume instead that it is of length n$,$ but that you don't know this length, and that the implementation of the array data type in your programming language returns the error message whenever elements A with in are accessed.