Q$5$: Find the complexity $($Exact and approximate$)$ for the basic operations of the following

algorithms:

sum$2=0$;

for $(k=1$;$kn$;$k^{**}=2)$

for $(j=1$;$jk$;$++j)$

$3.$ sum$2++$;

int Fun$2($int $n)$

$\{$

if $)$

return $1$ ;

for $($int $j=0$;$ji,j++$Fun;$in$;;$i$