Consider the pseudocode below.

function $f(n)$

if $n2$

return $4**n$

$k=1$

for i from $1$ to $n$

for $j$ from $i$ to $n$

$k=2**k+12$

return $k+f(\frac{n}{2})+3**f(\frac{n}{3})$

a$)(10$ pts$)$ Draw the first three levels $($including the root$)$ of a recursive tree for this function. Each

node should include T$(.).($Level $1(2$ pts$),$ Level $2(4$ pts$),$ Level $3(4$ pts$))$