Prove by induction that the recursive program given in the text makes exactly Fn recursive calls to fibonacci (1) when computing fibonacci (n).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.