We could extend the Fibonacci sequence to: S(O)=0, S(1)=1, and S(n) = S(n-1) +2 S(n-2) S: (0, 1, 1, 3, 5, 11, 21, ... Let's define the "basic operation for this problem as an evaluation of an S What is the recurrence of the time complexity T(n) for this recursive problem? [Relate it to the Fibonacci problem.] What is time complexity of Dynamic Programing for this problem? Why is a Dynamic Programming solution better than a recursive solution