8. (10 points) Dynamic Programming Consider a currency that has coins of denomina tions 1,6, 10, 14]. You want to make change for 19 cents. Use the Martian Coin Changing algorithm to solve this problem. a) (4 points) Fill in this array with the minimum number of coins needed to make change for the value stated. 9 6 3 0 15 16 17 18 19 10 12 13 (4 points) Fill in this array with the maximum sized coin used to make change for the value stated. b) 9 6 3 0 15 16 17 18 19 10 12 13 c) (2 points) What coins should be used to make change for 19 cents