Part A [50] A toy that many children play with is a base with three pegs and five disks of different diameters. The disks begin on one peg, with the largest dion the bottom and the other four disks added on in order of size. The idea is to move the disks from the peg they are on to another peg by moving only one disk at a time and without ever putting a larger disk on top of a smaller one. This child's toy is actually an example of a classic mathematical puzzle called the Towers of Hanoi problem. Write a recursive solution to this problem. It may take you a while to see the solution, but the program itself is quite short. Consider the source peg is A, the temporary peg is B, and the destination peg is C. Sample Input/output Enter number of disks: 1 Solution: A C Enter number of disks: 2 Solution: A- B A C B C Enter number of disks: 3 Solution: AC AB CB AC BA BC AC