Assume you are given an array$-$like data structure, E$,$ such that E is arbitrarily large and there is no way to know the size of it$.$ The array E is populated with integer values, from the beginning up to the nth cell, sorted in increasing order. The rest of the cells after the nth contain a very large integer call it max and you don$$t know n$.$ Your goal is to describe an algorithm that receives an integer value x $($x $<$ max$)$ and returns the position of that integer in E in O$($log n$).$ You can assume that x exists in E$.$