Q$5)$Consider an array A with $n$ entries, with each entry holding a distinct number. You are told that the sequence of

values $A[1],A[2],$dots,$A[n]$ is unimodal: For some index $p$ between $1$ and $n,$ the values in the array entries

increase up to position $p$ in A and then decrease the remainder of the way until position $n.$

Design an algorithm that finds the "peak entry" $p$ without having to read the entire array $-$ in fact, by reading as few

entries of $A$ as possible. Show how to find the entry $p$ by reading at most $O(logn)$ entries of $A.$ Prove that your

algorithm runs at $O(logn)$