In java

Implement the Towers of Hanoi

The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:

Only one disk can be moved at a time.

Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.

No disk may be placed on top of a smaller disk.

• Make a recursive Towers of Hanoi solution, simulate the disk moves.
• no formula can be used in code
• There are no print lines in the code(toString can be used)

Example of output Please enter the number of disks: 5 5 disks requires 31 moves