Tower of hanoi is a mathemeticL game that consist of x pegs n and disk of different sizes. The aim is to move disk to another peg by obeying simple rules. only one disk can be moved at a time.
each move consist of taking the upper disks from one of the stacks and placing it on the top of another stack(a disk can only be moved if it is the upper most disk)
No disk may be placed on top of the smaller disk.
The minimum number of moves :2^n-1 where n is the number of disks.
please solve this problem using recrusion technique by having 3 pegs and 3 disks. your program needs to show each step.