Question $4$

Consider the following code fragments $($a$),($b$),($c$)$ and $($d$)$ where $n$ is the variable specifying data size

and $C$ is a constant. What is the tight bound big$-$Oh time complexity in terms of $n$ in each case? Show

all necessary steps.

$($a$)$

for $($int $i=i+10j=1$;$j<mn\; id="EditorElement\_4307822">1</mn><mn\; id="EditorElement\_4307823">0</mn><mn\; id="EditorElement\_4307824">2</mn><mn\; id="EditorElement\_4307825">4</mn>$;$j=j***2+=j**\frac{*}{S}um[i]i=0$;$i$; $i=i+10$