Given an unlimited supply of coins of denominationsx1,x2,...,xn, we wish to make change for a valuev; that is, we wish to find a set of coins whose total value isv. This might not be possible: for instance, if the denominations are 5 and 10 then we can make change for 15 but not for 12. Give a dynamicprogramming algorithm for the following problem: You are givenx1,...,xn;v. Required:
Is it possible to make change forvusing coins of denominationsx1,...,xn