For the C$++$ function below, give the tightest asymptotic upper bound that you can determine for the function$$s runtime, in terms of the input parameter,

$.$ Also compute the return value of the function. Assume

$,$ and that

is a multiple of $16.$ In your answers, you may assume that

is base $2.$ Finally, our symbolic expression parser likes simplified logs$,$ so$,$ for example, rather than writing

$,$ you should write

$.$

int fun$($int n$)\{$

int r $=0$;

int q $=8*$n;

for $($int i$=0$; i$<=$q; i $=$ i$+4)$

for $($int j$=0$; j