a$)(5$ pts$)$ Consider the searching problem:

Input: A sequence of n numbers $=1,2,...,$ and a value $.$

Return: An index $$ such that $=[]$ or the special value NIL if $$ does not appear in $.$

Write pseudocode for a linear search, which scans through the sequence, returning $$ or NIL.

b$)(5$ pts$)$ For your searching problem algorithm, analyze the

efficiency of your algorithm as demonstrated in lecture.