Examine this algorithm. Given a sequence A and an element e$,$ this algorithm returns the smallest index of e in Sequence A if A contains e$.$ If A does not contain e$,$ this algorithm returns $-1.$

find$-$Element$($e$,$A$)$

index $=1$

while $(($index $<=$ A$.$length$)$ and $($A$[$index$]!=$ e$))$

index $=$ index $+1$

if $($index $>$ A$.$length$)$

index $=-1$

return$($index$)$

Given this problem instance with an n$-$items sequence and a number e$.$ In the best case, the number of comparisons for this algorithm will grow as