Search of an Element Let A[1..n] be an array with sorted entries and xA. The following algorithm finds the position i where A[i]=x. 1. Prove that the algorithm is correct. 2. Analyse the running time of the algorithm. 3. What is the design concept of the algorithm