Design dynamic programming solution for coin-change problem with coins of denomination 1,7,10. Provide pseudo-code for your algorithm. The goal of the coin-change problem is to give the change using the smallest number of coins. For example: 8=1+7 (2 coins), 10=10 (1 coin), 14=7+7 (2 coins). Hint: table for the problem is 1-dimensional (i.e.array). Execute you algorithm with the amount of change 14. Provide final state of the table.