Question $4$

$12\mathrm{.}5pts$

Select the best answer from each dropdown menu.

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$-$Elenent $(e$;$A)$

initex $-1$

index $=$ index $+1$

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

tive $x-1$

petanicindex$)$

Given this problem instance $e-45,A=(3,7,54,2,100,2,45),$ this

algorithm will execul comparisons and will retur