$(10$ points$)$ Determine $T(n)$ relationship between processing time and $n.$ Then determine a big$-0$ estimate for the number of operations $($a Simple Statement takes one unit of time$)$ used in this segment of an algorithm. SHOW YOUR WORK.Simple StatementSimple StatementSimple StatementSimple Statement

Example picture belew please doit like tris to leam

of an algorithm.

for$($int $1=0$

$i=0,i=1,i=2,$dots

$j=0,j=1,j=2,j=3$;cdots,$j=n-1$

$n+n+n+$cdots

$\frac{1+1+1+1+\text{c}\text{d}\text{o}\text{t}\text{s}+1}{n\text{t}\text{i}\text{m}\text{e}\text{s}}=n$

$n$ time

$=n^2$

$i=1$

$j=0,j=1,j=2,j=3,$cdots,$j=n-1$

vdots

$i=n-1nt=0,t=1,t=2,z=3,$dots$\frac{,}{b}ar(t)=n-14+4+4+4+$cdots$+4j=0$;$j$ Simple Statement Simple Statement Simple Statement Simple Statement