[5 = 3+2 points]: Linear search: Consider the searching problem: Input: A sequence of n numbers stored in the array A[1.:n] and a value x. Output: An index i such that x equals A[i] or the special value NIL if x does not appear in A a. [3 points] Write pseudocode for linear search algorithm, which scans the array from beginning to the end, looking for x. b. [2 points] Write the loop invariant for your pseudocode