Recursion – Fibonacci Tree

Problem Statement:

Compute fib(4) using recursion:

Recursive Definition: fib(n) = fib(n-1) + fib(n-2), with fib(0)=0, fib(1)=1