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$()$;

$\}$