Describe the running time of the following pseudocode in $1),2),3),4)$ and $5)$ in Big$-$Oh notation $($as tight

as possible$)$ in terms of variable $n.$ Assume all variables used have been declared. $[$Ruhrics: nleasedo.

not write anvthing unrelated to the question and give your answer clearly, no partial credit will be

given for this question.$]$

$.$ int foo $($int k$)\{$

int cost;

for $($int $=+(i**k)=n=cost+(i**k)$;;$++ij=0$;$j<mi\; id="EditorElement\_1090578">(</mi><mi\; id="EditorElement\_1090571">i</mi><mi\; id="EditorElement\_1090573">*</mi><mi\; id="EditorElement\_1090575">*</mi><mi\; id="EditorElement\_1090577">n</mi><mi\; id="EditorElement\_1090579">)</mi>$;$+j={\displaystyle \underset{?}{\overset{?}{}}}+jk=0$;;$++kc[k]=c[k]+=0$val$=$val$+i**jk=0$;$ki=0$;$i$

val$=$val$+i**j$;

for $(intk=0$;$k)i=0$;$ii=0$;$i$