Find the complexity $($Exact and approximate$)$ for the basic operations of the following algorithms: sum$=0$;

for $($k$=1$;k$<=$n;k$*=2)$

for$($j$=1$;j$<=$n;$++$j$)$

sum$++$;