Give a Big-O Estimate for the Number of Operations (Where $$\begin{array} { l } t : = 1 \\\text { for } i = n \text { to } n ^ { 2 } \\t : = t + 2 i t\end{array}$$

Short Answer

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: $$\begin{array} { l } t : = 1 \\\text { for } i = n \text { to } n ^ { 2 } \\t : = t + 2 i t\end{array}$$