Tower of Hanoi is a mathematical puzzle where we have three rods and n disks. It consists of three rods and several 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. We have to obtain the same stack on the third rod.

The objective of the puzzle is to move the stack to another peg following these simple rules.

- Only one disk can be moved at a time.
- No disk can be placed on top of the smaller disk.

Write a C# program to solves the tower of Hanoi

#### Solution: