Mock Hanoi Tower by Stacks

Problem

In the classic problem of Towers of Hanoi, you have 3 towers and N disks of different sizes which can slide onto any tower. The puzzle starts with disks sorted in ascending order of size from top to bottom (i.e., each disk sits on top of an even larger one). You have the following constraints:

• Only one disk can be moved at a time.
• A disk is slid off the top of one tower onto the next tower.
• A disk can only be placed on the top of a larger disk.

Write a program to move the disks from the first tower to the last using stacks.