Tower of Hanoi - NEEDS TO BE IN JAVA PROGRAMMING

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.

Implement a solution to the Tower of Hanoi problem using stack data structures. After each move, print out a visual of the current progress of the problem. Also keep track of how many moves it takes for your implementation.

In this project, there are 3 stacks and 7 discs to move. The minimum number of moves to solve the problem is 2⁷ 1 = 127 moves. You are not required to make the minimum number of moves, I just want to compare your implementation against the optimal implementation.