Consider the following algorithm:

int f$($n$)$

$/*$ n is a positive integer $*/$

if $($n return n

if $($n is even$)$

return f$($n$-3)+$f$($n$-2)$

else return f$($n$-4)+$f$($n$-1)$

Trace the execution of the above function on parameter n$=10$ by drawing the recursion tree for f$(10).$ Please draw the entire tree even if some subtrees are identical.

Consider the following algorithm:

int $f(n)$

$\frac{?}{?}***n$ is a positive integer ${?}^{***}$

if $(n5)$ return $n$

if $(n$ is even$)$

return $f(n-3)+f(n-2)$

else return $f(n-4)+f(n-1)$

Trace the execution of the above function on parameter $n=10$ by drawing the

recursion tree for $f(10).$ Please draw the entire tree even if some subtrees are

identical.