Q$1.$ What is the tight bound on worst$-$case runtime performance of the procedure below? Give an explanation for your answer. $(10$ points$)$ int c $=0$;

for$($int k $=0$; k $<=$ log$2$n; k$++)$

for$($int j $=1$; j $<=2^$k; j$++)$ c$=$c$+1$

return c