'Consider the searching problem: Input: A sequence of numbers A = (01, 0z, 03 _ a value V. Output: An index such that v = A[i] 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 loop invariant, prove that your algorithm is correct: Make sure that your loop invariant fulfills the three necessary properties.'