In class we saw that the Greedy algorithm to find the smallest number of coins may not always

deliver the optimal solution. For example, with just quarters, dimes, and cents you cannot use the

Greedy algorithm to find the optimal number of coins for $81$ cents.

Find another example of value smaller than $81$ cents, where these coins $($quarters$,$ dimes, cents$)$

in which the Greedy algorithm does not deliver the optimal solution.

Show the result of the Greedy algorithm and the optimal solution to your example.