Draw a call stack for the Tower of Hanoi problem. Assume that you start with a stack of three disks.
Using the recursive rules as described, draw a Sierpinski triangle using paper and pencil.
Using the dynamic programming algorithm for making change, find the smallest number of coins that you can use to make 33 cents in change. In addition to the usual coins assume that you have an 8 cent coin.