8. Given denomination d1, d2, d3, ... dn and an amount M, how can one pay the amount M using the given denominations using minimum number of coins. Apply Greedy strategy. Example Input: coin[] = {25,20,10,5) value = 50 Output: Total coins = 2 (25+25) Example Input: coin[] = {25,20,10,5) value = 70 Output: Total coins needed = 3 (25+25+20)