In Honduras there are the following coin denominations:
1, 2, 5, 10, 20 and 50.
Device a greedy algorithm that finds how to pay the
change to a customer with the least number of coins.
JOH became dictator of the country and decided to
change the coin denominations to: 1, 5 and 11. Would your algorithm
still work for these new coin denominations? Explain.
Need This solution asap