What is the time complexity of Fibonacci using dynamic programming?

Question

Accepted Answer

(C) O(n). Explanation: DP computes each Fibonacci number once and stores it — O(n) time, O(n) or O(1) space.