Consider the following recursive algorithm:

int f$($n$)$

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

if $($n$<=5)$ return n

int sum$=($ f$($n$-1)-$ f$($n$-2))+($ f$($n$-3)$ f$($n$-4))$

for i$=5$ to n$-1$ do for j$=$i to i$+1$

sum $=$sum$+$ j

$/*$ loops end here $*/$

return sum

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