Give a greedy and dynamic algorithm for a specific set ofcoins
In the United States, coins are minted with denominations of 1, 5, 10, 25, and 50 cents Now consider a country whose coins are minted with denominations of [di,…,dk} units. They seek an algorithm that will enable them to make change of n units using the minimum number of coins. 1. The greedy algorithm for making change repeatedly uses the biggest coin smaller
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured