Write a program that displays the series of steps to solve the Towers of Hanoi as visual output to the console. Your program should work for any number of disks, but we will only be testing output for the situation where n = 5. Some things to note: Each tower will be represented by a stack data structure, so you will need to maintain three stacks in your program. The disks will be represented by the integers 1 to n. When a disk moves from one stack, it must be popped from that stack. When a disk is added to a stack, it must be pushed to that stack. Your program output should mirror the output below: Stack A starts with 5 disks on it, represented by the integers 1 to 5. Empty spots on stacks are represented by the symbol. Here is what the initial output of the program should look like for n=5: ~/Towers-of-Hanoi$ python3 towers.py Hit -enter- key to continue 0 After each step is displayed, the user should be prompted to hit the enter-key to see the next step displayed.