The time complexity of the following recursive algorithm is $\backslash$Theta

$(\_\_\_\_\_\_\_\_\_\_\_\_\_\_)$

public static double mystery$($ double x $,$ int n$)\{$

if $($n $<=0)$ return $4*$x$+1$ ;

for $($ int i $=0,$ double prod $=1\mathrm{.}0$ ; i $<$ n ; i$++)$ prod $*=$ x $+5*$i ;

return mystery$($prod$+$x $,3*$n$/4)+$ mystery$($prod$+$x$+2,$ n$/4)+$ x$/2-3$ ;

$\}$

Question $28$Answer

a$.$

nlog$2$n

b$.$

nlogn

c$.$

n$2$

d$.$

$2$n