Given the algorithm. procedure f(a1,a2,…,an: integers, n: integer > 2, x: integer)

i := 1

while (i < n and ai + an-i ≠ x)

i := i + 1

if (i < n) then output := i

else output := 0

Let n = 100. Count the number of additions in the worst case.