Remarks: In all the algorithms, always explain (more precisely try to prove the correct- ness of your algorithm You Always Must analyze the running time of any algorithm. The time complexity should be as small as possible. A correct algorithm with large complexity, may not get full credit. Do EVEN THINK OF WRITING PROGRAMS. The Rollo Thomasi legacy: work alone. Question 2: Given a sorted array A of n numbers and an additional number I, give an algorithm that checks if there is i so that (A[i]) = x Example: Say that A = and r = 400. Then the answer is yes as 202 = 400. If x = 49 the answer is no since 7 & A