You are given an unlimited supply of coins of denominations vi , . . . , Vn N and a value W E N. Your goal is to make change for W using the minimum number of coins, that is, find a smallest set of coins whose total 1. Design a dynamic programming algorithm for solving the change making problem. What is its running 2. You now have the additional constraint that there is only one coin per denomination. Does your value is W. time? previous algorithm still work? If not, design a new one