4. Choose Function (4 points) Given n and k with n k > 0, we want to compute the choose function (k using the following recurrence: Base Cases: (8) = 1 and (en) = 1, for n 2 0 Recursive Case: () = (7-4) + (N1), for n > k> 0 k-1 (1) (1 point) Compute (3) using the above recurrence. (2) (2 points) Give pseudo-code for a bottom-up D dynamic programming algorithm to compute () using the above recurrence. (3) (1 point) Show the dynamic programming table your algorithm creates for