int myfun$3($int$[]$ A$,$ int n$)$

$\{$

int i$,$ j$,$ s $=0$;

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

s $=$ s $+$ A$[$i$]$;f

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

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

if $($A$[$i$]==$ A$[$j$])$

return $-$s;

return s;$\}$

Using the $\backslash$theta $($theta$)$ notation, what is the best$-$case running time of "myfun$3"?$

a$)(n)$

$b$