題組內容

1. Fibonacci sequence is 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on. We want to compute a
certain Fibonacci number Fib(n).

(b)What is the space complexity using a recursive algorithm? (5%)