Integer Linear Programming using Lindo

Given coins of denominations (value) 1 = v1 < v2< ... < vn, we wish to make change for an amount A using as few coins as possible. Assume that vis and A are integers. Since v1= 1 there will always be a solution. Solve the coin change using integer programming. For each of the following denomination sets and amounts, formulate the problem as an integer program with an objective function and constraints. Determine the optimal solution. What is the minimum number of coins used in each case and how many of each coin is used? Include a copy of your code. a) V=[1,5,10,25] and A=202.

b) V=[1,3,7,12,27] and A=293