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

algorithms:

sum$=0$;

for $(k=1$;$kn$;$k**=2)$

$,$for$(j=1$;$jn$;$++j)$

sum$++$;

${\displaystyle \underset{?}{\overset{?}{}}}2=0$;

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

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

$,{\displaystyle \underset{?}{\overset{?}{}}}2++$;

int Fun$2($int $n)$

$\{$

if $(n0)$

return $1$;

for $($int $j=0$;$ji$;$j++1**Fun3(\frac{n}{2})nmo(n0)(n-1,m+1,0)n-1,m,0+1i=1$;$in$;;$i$