sum $=0$; for $($k$=1$; k$<=$n; k$*=2)$ for $($j$=$n; j$<=1$; j$/=2)$

sum$++$;

The time complexity of the algorithm is

Select one:

a$.$ O$($log n$^2)$

b$.$ O$($logn$)$

C$.$ O$(($log n$)^2)$

d$.$ O$($n$^2)$