Select the best answer from each dropdown menu.

Examine this algorithm. Given a sequence A and an element e$,$ this algorithm returns the largest 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 $=$ A$.$length

while $(($index $>0)$ and $($A$[$index$]!=$ e$))$

index $=$ index $-1$

if $($index $<=0)$

index $=-1$

return$($index$)$

Given this problem instance $[$e$=3,$ A$=(3,7,54,3,100,2,45)],$ this algorithm will execute

comparisons and will return