COMP 1672 Sections 1 & 2
Homework #4
Due Tuesday morning, January 28, 2003


1.  Do problem 2 on page 496

2.  Do problem 4 on page 496

3.  Do program 3 on page 498.

4. Extra credit: Enhance the Towers of Hanoi problem from class
   so that it counts and outputs the number of steps needed to
   move the initial stack of disks.