C++ problem to arrays the following classic game, Towers of Hanoi.

Homework #3: Towers of Hanoi Overview In this homework you will m Towers of Hanoi. This is a mathematical The game starts with the disks placed in the leftmost stack. The disks are placed in ascending order, this is, the smallest disk at the top. The goal of this game is to move the entire leftmost stack to the rightmost stack. ake use of arrays and control flow structures to solve the classic game l game that consists of three stacks and a number of disks. You must adhere to the following game rules: Only one disk can be moved at a time. *Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack. Only the uppermost disks can be moved. No disk may be placed on top of a smaller disk. Binary Representation This problem can be solved in a number of ways. We are going to solve it through a simple binary representation. These are the rules for the model: There is one bit for each disk The most significant bit represents the largest disk. The least significant b it represents the smallest disk. .Start reading the bits from the right. The first bit to have a value of 1 is the source disk (or the disk to be moved) The second bit to have a value of 1 is the destination disk If the number of zeroes in between the first and second bit is even (or zero) then move the source disk on top of the destination disk. If the number of zeroes in between the first and second bit is odd then move the source disk on top of the stack not containing the destination disk. * If there is only one bit with the value of 1 move the disk to any stack you see fit. In the end, all the disks from the leftmost stack must be placed in the rightmost stack. Let's assume we have only three disks (D3, D2, D1), then we would have something like this