n>o Given the following recursive function: f(0)=1 f(n)=2f(n-1)+2" Answer 1-4 1. Write a recursive algorithm compute f(n). What is the run time of your algorithm in terms of O-notation. Show your work. 2. Write a Dynamic programming algorithm compute f(n). What is the run time of your algorithm in terms of O-notation? 3. From (1) and (2), which is faster the recursive algorithm or the dynamic programming algorithm? Justify your answer. 4. How Dynamic Programming is different from Recursion