3. Consider the following recurrence. 

 

 (a) Design and write a pseudo code for a recursive procedure to compute T(n). 

(b) Draw the execution tree for T(7). 

(c) Using the concept of dynamic programming, rewrite your recursive procedure into a non-recursive one.

T(n)= 1 2 if n == 0 or n == 1 if n == 2 T(n-1)+T(n-3) if n > 2