Question: 24
(Choose 1 answer)
(See picture)
A. 2
B. 3
C. 4
Given the algorithm procedure la (a1, a2, ..., an integers)m: = a1 t:= 0 for i:= 2 to n if (am) then m:=a t:=t+1
D. 8 E. None of the other choices is correct
If the input is the list [1, 6, 2, 3, 7, 7, 4, 8, 8, 6]
how many additions are used?
