Programming Question

Write a Python function named toCashier$()$ to implement cashier's algorithm. It

receives a positive integer $n$ as parameter, and prints $n$ cents in change with fewest

coins possible when changes is made from quarters, dimes, nickels, and pennies.

Write a Python program to traverse through the following list:

$33,49,51,60,69,76,87,99,$ then call toCashier$()$ function with each element in the

list and prints the changes.