dynamic programming

4. Dynamic Programming I (2 points) Suppose we define a new version of the Fibonacci numbers where: fo=0 fl = 1 In = fn-1 + 3 * fn-2 llowing function to calculat Algorithm 1 int fib(int n) 1: if n- 0 then 2: return 0; 3: else if n= 1 then 4: return 1; 5: else 6: return fib(n - 1)+3*fib(n - 2); 7: end if (1) Complete the tree of recursive calls which are made to calculate fib(6) (recurse down to the base cases): fib(6) fib(5) fib(4)