The Fibonacci series can be computed as follows, F(n) = F(n 1) + F(n 2) (1) In class, we showed how this can be done in O(log n) computation time. Now suppose that the de nition is changed in the following way, F0(n) = F0(n 1) + F0(n 2) + F0(n 3) + F0(n 4) (2) Can F0(n) be computed in O(log n)? If yes, please show how it can be done. If no, show a counterexample where this fails. Please provide your rationale for both. Assume that F0(0) = 0; F0(1) = 1; F0(2) = 1; F0(3) = 1.