(Choose 1 answer)
(See picture)
Determine the complexity of this algorithm in terms of the number of comparisons.
A. None of the other choices is correct
B. (iii)
C. (ii)
D. (i)
procedure thuattoan(a1, a2..., an: integers)k: 0 for i:=1 to n do if a < 0 then k := k+1 print(k)
(i) O(n)
(ii) O(logn)
(iii) O(1)
Exit 30
