Answer 1-4 1. Write a recursive algorithm compute T(n). 2. Give a non-recursive optimal algorithm (i.e. Dynamic programming algorithm) for computing the function T(n). What is the run time for your algorithm in terms of O-notation? 3. which is faster the recursive algorithm or the dynamic programming algorithm? Justify your answer. 4. Does dynamic programming always yield to an optimal solution? How Dynamic Programming is different from Recursion? if j = 0,1 please help ASAP

Given the following recursive function: T(n) = 2 T(n)=E T30T-1) if n=0,1 if n>l Answer 1-4 1. Write a recursive algorithm compute T(n). 2. Give a non-recursive optimal algorithm (i.e. Dynamic programming algorithm) for computing the function T(n). What is the run time for your algorithm in terms of O-notation? 3. which is faster the recursive algorithm or the dynamic programming algorithm? Justify your answer. 4. Does dynamic programming always yield to an optimal solution? How Dynamic Programming is different from Recursion