I'm Selena, and this is my first post, so I don't really know if I'm doing it right, so if there are any improvements please tell me
This program calculates the minimum number of steps for the Hanoi tower using recursion. There is more info in the program, because I am bad at explaining this.
Also, the program takes a bit of time to start (I think) but I hope it works.
I think next time I might print the process of solving the problem.