(Choose 1 answer)
(See picture)
A. None of the other choices is correct
B. The last location of the smallest element in the list of integers
C. The smallest element in the list of integers
D. The first location of the smallest element in the list of integers
What is the output of the algorithm?
procedure tt (a1, a2, ,an: integers)d := a1 for i:=1 to n do if da; then d := a;k := n while (k>= 1) and (ar > d)k: k-1
Print(k)
wi
9
