Show that if the denominations of coins are c0, c1,…,ck, where k is a positive integer and c is a positive integer, c > 1. the greedy algorithm always produces change using the fewest coins possible.

Solution: Step 1 :In this problem we have to prove the greedy algorithm always shows the changes.