What will be the time and space complexity of the dynamic programming algorithm for determining the Fibonacci number?

What will be the time and space complexity of the dynamic programming algorithm for determining the Fibonacci number?

From the BPSC Assistant Database Administrator (CSE) 2022 – Written exam, question 6 of 18.

More from this paper

Previous: Write down the Algorithm for determining Fibonacci number through dynamic programming.
Next: Why Normalization is used in database? Explain 1st Normal form using an example.
All questions in BPSC Assistant Database Administrator (CSE) 2022 – Written