The Tower of Hanoi is a mathematical puzzle. It consists of three stacks, A, B, C and a number of disks of different sizes stacked in ascending order of size on one stack; the smallest at the top.

Problem is to move all the discs from one stack to another satisfying the following rules:

Only one disk can be moved at a time

A disk can only be moved if it is the top disk on a stack

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

Implement the recursive Tower of Hanoi for n disks. Determine the minimum number of moves required to move any given number of disks and show your moves.

Please code in Python 3