Consider the following loop where $n=2^k$ for $k0.$

$sm-0$;

for $(i+1$;$in,i+2i)do$

for $(y<mn\; id="EditorElement\_2075861">1</mn>$:$ji,j+2j)do$

$s.m+$ sum $+1$

$($a$)$ Count the number of times that sum $-$ sum $+1$ is executed.

$($b$)$ What is the efficiency class of the loop?Consider the following loop where $n=2^k$ for $k0.$

$sym-0$ :

for $(i+1$;$in,i+2i)do$

for$(j<mn\; id="EditorElement\_2075457">1</mn>$;$ji,$jlarr$2j)do$

$stm+$ sum $+1$

$($a$)$ Count the number of times that sum $+$ sum $+1$ is executed

$($b$)$ What is the efficiency class of the loop?