4) Give a big-O estimate for the number of operations, where an operation is an addition, used in this segment of an algorithm. Justify your answer

I = 1

t = 0

while I <= n {

for j = 2 to n

t = t + 1

i = I + 2}