Question: For problems 1 and 2, assume that F(??) represents the nth Fibonacci number.
Question 1: Prove by induction that the number of nodes in the activation tree for the Fibonacci function is 2F(n + 1) - 1.
Applying the formula for the activation tree n = 3: 2F(3 + 1) - 1 = 2F(4) - 1 = 2 * 3 - 1 = 5.
Include comments in code section that will be useful.