What are the steps to

c$)$ Use aigorithms sequential search below to explain best, worst and average case efficiency:

Algorithm sequential secuch $($A $[$O dots.$n-1$

Algorithm searches for a given value in agieu

Algorithm aray by sequential search

Algorithm input: An array $A.$ O $q,n-11$ and a

Algorithm Search key. K

Agorithm Output: The index of the first element

Algorithm in A that matches $K$ or $-1$ if there

Algorithm are no matching elements

$1=0$

While $1$ &it: $n$ and $A(3)=$kdO

$1=1+1$

If $1$ &it: $n$ return $1$

Fisereturn$-1$