Describe the order of growth for each of the following code sections. For each code section,

clearly indicate the number of times the loop$($s$)$ runs and then express the overall efficiency

using Big$-$O notation.

a$.$

for$(i=1$; $in$;$i++$

$j=1$

while $(jn)\{$

print $(i,j)$

$j=j***2$

$\}//$end of while

$\}//$end of for

b$.$

sum $=0$

for$((j=0$;$j<mn\; id="EditorElement\_921785">1</mn><mn\; id="EditorElement\_921786">0</mn>$;$j+=2)i=0$;$i$

sum$++$

for $(j=0$;$j<mn\; id="EditorElement\_921846">1</mn><mn\; id="EditorElement\_921847">0</mn>$;$j+=2)$

sum$--$

print $(sum)$