2. (6 points) Show that if there were a coin worth 17 cents, the greedy algorithm using quarters, 17-cent coins, dimes, nickels, and pennies would not always produce change using the fewest coins possible. Note: for full credit, you need to find an erample where the greedy algorithm does not produce change using the fewest coins possible, and then describe why this example works: trace the greedy algorithm to explain how many coins it would produce in change? uhat's a better way to make change using fewer coins? Second note: for worked eramples related to this question, refer to Week 1 discussion section worksheet