Please provide as much detail as possible! Pseudocode. Consider the search problem and answer the following question. $(5$ points$)$

Input: A sequence of n numbers A $=$ 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$.$

Write a pseudocode for linear search, which scans through the sequence to look for v$.$

What is the loop invariant? What is the worst$-$case run time in $-$notation?