$2.[6$ pts$,2$ pts each$]$ For each of the following pieces of code, find the number of times fun$()$ is

called with the input size n$.$ Express your answer in terms of the order of growth of the running

time, drop coefficients and keep only the highest order term.

A$)$ for $($i $=0$; i $<$ n; i$++)$

$\{$

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

fun$()$;

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

fun$()$;

$\}$

B$)$ for $($i $=1$; i $<=$ n; i$++)$

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

for $($k $=1$; k $<=$ i; k$++)$

fun$()$;

C$)$ void methodA$($int n$)$

$\{$

if $($n $==0)$ return;

for $($int i $=0$; i $<$ n; i$++)$

fun$()$;

methodA$($n$/2)$;

methodA$($n$/2)$;

$\}$