Towers of Hanoi Section 3.4 of Budd (pp 56-59) describes a recursive implementation of an algorithm to solve the Towers of Hanoi 'game'.

Towers of HanoiSection 3.4 of Budd (pp 56-59) describes a recursive implementation of an algorithm to solve the Towers of Hanoi 'game'. Write a program that implements the same algorithm using a stack data structure instead of recursion. Take one unit of work to be moving one disk from one tower to another tower. Have your program output the moves and the amount of work done. (Note that the stack should be used to represent pending moves, not necessarily the towers themselves. In the recursive algorithm, there is no actual representation of the towers or individual disks.) Estimate the order of your algorithm, and justify your estimate. Verify that your program works for 3 disks (as shown on p. 59). Try it for some different (but small!) number of disks. Check that the amount of work done varies according to your order estimate. Additional Requirements Level of Detail: Show all work IN C++ LANGUAGEI'm so sorry for the late response. I have been busy working and have not checked my email. I will upload the pages from the book l'm using which is called Data Structures in C++ using standard Template Library by timothy budd. cannot upload now by will do later when I get a chance. Thank you