Use the greedy algorithm to make change (i) using quarters, dimes, nickels, and pennies and (ii) using quarters, dimes, and pennies (but no nickels) for the following amounts. For each algorithm and amount decide whether the greedy algorithm returns the optimal solution (i.e. uses the fewest coins possible)? (a) 87 cents (b) 80 cents