(A) [10 Marks] Write an efficient recursive algorithm to find Binomial Coefficients based on Dynamic Programming - Memoization (using memory functions) approach. The recurrence relation to find Binomial Coefficients is as follows: C(n,k) = C(n-1,k) + C(n-1,6-1) for n >k>0 C(n,0) = 1, C(n,n) = 1 for n >= 0 (B) [5 Marks] Based on the recurrence of Part (A), make table as used in the dynamic programming solution, to find C(5, 3). Use the editor to format your answer Question 2 10 Points Construct a max-heap from the set of keys given below, using the bottom-up heap construction algorithm: 10, 20, 30, 60, 40, 5, 50, 70 Show the final answer in an array. Use the editor to format your