Give the big-O estimate for the number of operations where an operation is an addition or a multiplication, used in this segment of an algorithm (ignoring comparison used to test the condition in the while loop).

i:=1 t:=0

while i < n

t:= t+2i

i:= i+1