$3\mathrm{.}2)[3$ points$]$ Consider the following $C++$ implementation to answer the next

subquestions:

int func$($int $n\{$

if

return $2$ ; $\}$

else $\{$

return $\frac{n}{log(n)+2**}$ func $(\frac{n}{2})$;

$\}$

Q$23\mathrm{.}1.-$ What is the base case? $[0\mathrm{.}5$ point$]$

Q$23\mathrm{.}2.-$ What is the recurrence case? $[0\mathrm{.}5$ point$]$

Q$23\mathrm{.}3.-$ What is the running time of func$($n$)$ in the worst case scenario in terms of big$-$O$?$

$[2$ point$]$