Consider the searching problem:
Input: A sequence of n numbers A = ha1; a2; : : : ; ani and a value v.
Output: An index i such that v = A[i] or the special value nil if v does not appear in A.
(a) Write pseudocode for linear search using the CLRS3e style used in our class, which scans through the sequence, looking for v.