題組內容

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).


(a)What are the time complexity and space complexity using an iterative algorithm? (5%)