$(20$ points$)$ Suppose that we are given an array A$[1..$n$]$ of integers $($possibly containing negative integers$)$ such that A$[1]<$ A$[2]<...<$ A$[$n$].$ Give an O$($lg n$)$ time algorithm to decide if there exists an index i$,1$