need help

pyhton only

The Tower of Hanoi is a puzzle t (Links to an external site.)Links to an external site.hat consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical (Links to an external site.)Links to an external site. shape. Using stacks and showing what each stack looks like after every move.

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.

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

With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n 1, where n is the number of disks.

randomize the disks between 4-10

Write code that will perform the moves necessary to move one stack to another stack obeying the rules above.

Pole 1 Pole 2 Pole 3 Pole 1 Pole 2 Pole 3