other math

Frequency Count

Frequency Count

for $i=1$ to $n$

for $j=1$ to $100$

print $(i,j)$

$T(n)=$

Frequency Count

$x=0$

for $k=2$ to $n+1$

for $j=3$ to $n-3$

$x=x+1,T(n)=$

$x=0$

for $k=2$ to $n+1$

for $j=3$ to $n-3$

for $k=4$ to $n-4$

$x=x+1$

Frequency Count

$T(n)=$ Frequency Count

for $k=2ton+1$

for $j=3ton-3$

$x=x+1$

for $k=4ton-4$

$x=x+1$

$s=0$

for $i=1ton$

for $j=1toi$

for $k=1toi$

$s=s+k$

return $s$

$s=0$

for $i=1ton$

$s=s+(i**i)$

return $s$

return $s$

Frequency Count

$T(n)=$

Frequency Count

$T(n)=$Highest Possible Score: $50$

Instructions. For each code fragment, obtain the function $T(n)$ that describes the running time. Express your answer in simplest form. BOX YOUR

FINAL ANSWER. Deductions will be given for not following instructions. $[5$ MARKS each$].$

Frequency Count

$T(n)=T(n)=$