Language: C++

The Tower of Hanoi is a famous mathematical puzzle. In a temple in the Far East, priests are attempting to move a stack of golden disks from one tall pole to another. The initial stack has 64 disks stacked onto one pole and arranged from bottom to top by decreasing size. The priests are attempting to move the stack from one pole to another while following these rules: 1) Only one disk can be moved at a time. 2) Each move consists of taking the upper disk from one of the stacks and placing t on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack. 3) No disk may be placed on top of a smaller disk. Below is the workflow of the process for 4 disks. Write a recursive function hanoiTower to solve this