Write an Algorithm, not code

5. (30 points) The Tower of Hanoi problem is often used to illustrate that there is more than one way to skin a cat; in other words, there are many ways of solving a problem. Remember Gray Codes from your Digital Logic class? For any number of n disks stuck on the Tower of Hanoi, one can determine what disk to move by counting from 0 to n-1 in Grey Code. Remembering that Gray Codes are organized so that only one bit position changes as numbers increase, one can determine which disk to move by looking at the bit position that changes as the count increases. How do you know where to move the disk? For the smallest disks, there are two possibilities but always only one for any other disk. For the smallest disk. let f by the starting peg, t be final peg, and r the remaining peg. If the number of disks is odd, the smallest disks cycles along the pegs f +t+ror, if even, f +r+t. Write an algorithm that uses Gray Codes to solves the Tower of Hanoi problem for any number of disks n. NOTE: I am asking for you to write an algorithm, not go and break out the C++ compiler or the Python interpreter (or, heaven forbid, the COBOL compiler). 5. (30 points) The Tower of Hanoi problem is often used to illustrate that there is more than one way to skin a cat; in other words, there are many ways of solving a problem. Remember Gray Codes from your Digital Logic class? For any number of n disks stuck on the Tower of Hanoi, one can determine what disk to move by counting from 0 to n-1 in Grey Code. Remembering that Gray Codes are organized so that only one bit position changes as numbers increase, one can determine which disk to move by looking at the bit position that changes as the count increases. How do you know where to move the disk? For the smallest disks, there are two possibilities but always only one for any other disk. For the smallest disk. let f by the starting peg, t be final peg, and r the remaining peg. If the number of disks is odd, the smallest disks cycles along the pegs f +t+ror, if even, f +r+t. Write an algorithm that uses Gray Codes to solves the Tower of Hanoi problem for any number of disks n. NOTE: I am asking for you to write an algorithm, not go and break out the C++ compiler or the Python interpreter (or, heaven forbid, the COBOL compiler)