1. Consider the following recurrence ifn=0 n-1 Cm) 2 + n otherwise Write a function in C/C++ to compute C(n) using dynamic programming. Your algorithm must be iterative and should use a table. In computing C(3) show the contents of the table. Analyze the time and space complexity of your algorithm. a. b. c. 1. Consider the following recurrence ifn=0 n-1 Cm) 2 + n otherwise Write a function in C/C++ to compute C(n) using dynamic programming. Your algorithm must be iterative and should use a table. In computing C(3) show the contents of the table. Analyze the time and space complexity of your algorithm. a. b. c