PLEASE USE JAVA

Iterative Tower of Hanoi

Tower of Hanoi is a mathematical puzzle. It consists of three poles and a number of disks of different sizes which can slide onto any poles. The puzzle starts with the disk in a neat stack in ascending order of size in one pole, the smallest at the top thus making a conical shape. The objective of the puzzle is to move all the disks from one pole (say source pole) to another pole (say destination pole) with the help of the third pole (say auxiliary pole).

The puzzle has the following two rules:

1. You cant place a larger disk onto smaller disk 2. Only one disk can be moved at a time