NEED THE CODE FOR TOWER OF HANOI PUZZLE ASAP GOT PROJECT DEADLINE SOON

Tower of Hanoi (also called the Tower of Brahma or Lucas Tower [1], and sometimes plural) is a mathematical game or puzzle. It consists of three rods, as well as a number of disks of different sizes that can slide onto any rod. The puzzle starts with the disks in a neat pile in ascending order of size on one rod, the smallest at the top, thus making a conical shape.

The aim of the puzzle is to move the entire stack to another rod, obeying the following simple rules:

Only one disk may be moved at a time.
Each move consists of taking the upper disk from one of the stacks and put it on top of another stack i.e. the drive can be moved only if it is the top disc on the stack.
Disk cannot be placed on top of a smaller disk.
With three disks, the puzzle can be solved in seven moves. The minimum number of moves needed to solve the Tower of Hanoi puzzle is 2n-1, where n is the number of disks.