Let T$($n$)$ denote the number of times that the recursive function DoSomething$($n$)$ prints $``$banana$"$ What is T$($n$)?$

int DoSomething$($int n$)$

$\{$

for $($int i $=0$; i $<$ n; i$++)\{$print "banana"; $\}$

if $($n $<=2)$

return $1$;

else

x $=$ DoSomething$($n$/3)$;

y $=$ DoSomething$($n$/3)$;

return x$+$y;

$\}$

a$.$ theta$($n$)$

b$.$ theta$($n log n$)$

c$.$ theta$($log n$)$

d$.$ theta$($log log n$)$