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}$$

question 4

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}$$

---

Definitions:

Elephanta

An island near Mumbai, India, known for its cave temples that are carved out of rock and dedicated to the Hindu god Shiva.

Sandstone Relief

A sculptural technique where the figures and motifs are carved slightly above the background, often found in ancient buildings and monuments.

Creative Aspect

The element of creativity involved in producing something original or imaginative in the arts, literature, or other forms of expression.

Vishnu

A principal Hindu deity, worshiped as the protector and preserver of the universe, often depicted with blue skin and holding a conch, discus, lotus, and mace.