Once you have a solution to the Towers of Hanoi problem, we want to improve the display of the solution. The details of the implementation are up to you. At a minimum, your implementation should provide the output that is described here.
Instead of merely showing the instructions that specify the movement of disks, your program should display three pegs and the disks that exist on the pegs at the start of the program and after each move. Each disk must have a unique representation. It is suf?cient to have each disk represented by an integer where 1 is the smallest disk, 2 is the second smallest, 3 is the third smallest, and so on. Each peg should have a total height corresponding to the total number of disks. Empty locations on a peg should be represented in a suitable way (perhaps with a period or a vertical line.