(Choose1answer)
(Seepicture)
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
A. 4 B. 3
C. 8
D. 2
If the input is the list
8
[1, 6, 2, 3, 7, 7, 4, 8, 8, 6]
E None of the other choices IS correct
<
how many additions are used?
