Consider the following recursive algorithm:

int f$($n$)$

$/*$ n is an integer greater than equal to $1*/$

$\{$

Let abc be the last three digits of your CWID; $/*$ my CWID ends with $470$; a$=4,$ b$=7$; c$=0*/$

if $($n$==1)$ return c;

if $($n$==2)$ return b;

if $($n$==3)$ return a;

int x $=$ f$($n$-1)+$ f$($n$-2)$ ;

if $($n is even and x is even$)$ then x $=$ x $+$ f$($n$-3)$ ;

return x ;

$\}$;

Draw the recursion tree for f$(8).$ In this tree, draw all subtrees even though some of them may

be identical. Show the returned values for each recursive call. In particular, what is the value

returned for f$(8)?$