Give a big$-$ estimate for the number of operations $($where an operation is an addition, a

multiplication, or something being raised to a power$)$ used in this segment of an algorithm.$0$

for $1$ to

for $1$ to $2++$