** java**

**Tower of Hanoi code**

1. Is an iterative solution to the Tower of Hanoi problem possible? (10 points)

2. If so, what is the complexity of the iterative algorithm? Is this greater, less than or the same as the complexity of the recursive algorithm ? Recall that the complexity of the Tower of Hanoi algorithm is measured by the number of moves as the number of disks increases.(10 points)

3. Take the program depicted in the code, type it into your IDE editor, debug if necessary and submit as a working program (30 points)