Question $2(10$ points$)$

What is the space$-$time tradeoff when using memoization in Fibonacci number calculation?

$O(2^n)$ time and $O(1)$ space

$O(n)$ time and $O(n)$ space

$O(logn)$ time and $O(n)$ space

$O(n^2)$ time and $O(1)$ space