The values of the available coins are:

dollar coin = 100 cents.

quarters = 25 cents.

dimes = 10 cents.

nickels = 5 cents.

pennies = 1 cent.

Problem 6.4. Suppose the coinage includes the values given in Section 6.1, but you have run out of nickels. Show that using the greedy algorithm with the remaining values does not necessarily produce an optimal solution