In the lecture we discussed polynomial time algorithms for computing Fibonacci number Fn. Note that they require storing all previous Fibonacci numbers. Come up with an algorithm that still works in polynomial time, but does not store an array, the size of which depends on n. (Hint: recall bottom-up implementation for Fibonacci numbers from the lecture. Which previous numbers do we actually need to store to compute each next Fibonacci number?)