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

algorithms:

sum $-$;

for $(k-1$;$kc-n$;$k**-2)$

for $(j-1$;$j-n$;$++j)$

sum$+$t;

sun$2-$;

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

for $(j-1$;;$++j)$

sun $2++$;

int Fun$2($int $n)$

$\{$

if

return $1$;

for $($int $j-$;$j-i$;;$i-n$;$i^{**}-2O(n^5)T(n)T(n)=2T(\frac{n}{2})+aT(1)=$babT$(n)=(nlogn)slarr0$

for ilarr$1tondo$

$BS+i^{**}i$

Return $Si-$;$i$

for$(intj-$;$j-i$;$j++)$

constoperation;

return $1*$ Fun$3(\frac{n}{2})$;