Exercise 3: (8 points) Consider the searching problem: Input: A sequence of n numbers A = [a1, Q2, ..., An) and a value v. Output: An index i such that v= Ai] or the special value NIL if v does not appear in A. Write pseudocode for linear search, which scans through the sequence, looking for v. Using a loop in- variant, prove that your algorithm is correct. Make sure that your loop invariant fulfills the three necessary properties