Q$5$: Find the complexity $($Exact and approximate$)$ for the

basic operations of the following algorithms:

Q$1)$sum$=0$;

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

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

sum $++$;

Q$2)$sum $2=0$;

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

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

sum$2++$;