[10 marks] Give a big-O estimate for the number of operations, where an operation is an addition or a multiplication, used in this segment of an algorithm. Ignore comparisons used to test the conditions in the while loop. t:= 0 whill t:= t + i i := 2x1