The Tower of Hanoi puzzle was invented by the French mathematician Edouard Lucas in 1883. We are given a tower of five disks (you can ask user for the number of disks), initially stacked in increasing size on one of three pegs. The objective is to transfer the entire tower to one of the other pegs, moving only one disk at a time and never a larger one onto a smaller. Write a C++ program to solve the puzzle. You must use recursion. Be creative and use your imagination for the output display. (such as 3D display)

Please give solution different from 3d display. something different please