C program

Every balding computers met grapple with certain problem. In the af Hanet Fige below)weathenow offee Legesturile de Par Fast priestorompting to reakfastro e per ther. The lack Pad 64 shaded to one personaged from time top by decreases. The prieste enpeng to the stock to this page and pogunder the Cathy te dink is moved at time, and to tame may alaper deak be placed here allerdid. A hind peg savaible for temporarily in the disk Sappenedly the world will end when the meses complete the tank the link incerte for de facilitate their efforts Les me that the press meeting to the dink from pepe 1 Wewah develop an algoritm tut will print the price one of dusk-to-dok per If we were to the problem with and we would rapidly find nebeply dup managing the diskt Italiteta te ble wiem immediately becomes tractable Merving dista can be down in termeny - 1 dake and hence the reason for Mwen- dis tromper o pes 2.permotary bulding More dhe duke the largest from postope Move the adidas trompes 2 topes 3 coing peg stemporary Multing area. The price when the last tak obe moving dee he came. This komplished by trivially moving the disk with the need for a long was program to solve the Town of Hanoi problem se receive function with four paren a Theber of disto The which dies are intered The whisk of disk is to be me The to be a bolding area Your program pret the precision it will take to move the discrete pes to the dette porno mwa stack of three dinkstumper program penge 1 }(This med postoper 3 Every budding computer scientist must grapple with certain classic problems, and the Towers of Hanoi (see Figure below) is one of the most famous of these. Legend has it that in a temple in the Far East, priests are attempting to move a stack of disks from one peg to another. The initial stack had 64 disks threaded onto one peg and arranged from bottom to top by decreasing size. The priests are attenopting to move the stack from this peg to a second peg under the constraints that exactly one disk is moved at a time, and at no time may a larger disk be placed above a smaller disk. A third peg is available for temporarily holding the disks. Supposedly the world will end when the priests complete their task, so there is little incentive for us to facilitate their efforts. Let's assume that the priests are attempting to move the disks from peg 1 to peg 3. We wish to develop an algorithm that will print the precise sequence of disk-to-disk peg transfers. If we were to approach this problem with conventional methods, we would rapidly find ourselves hopelessly knotted up in managing the disks. Instead, if we attack the problem with recursion in mind, it immediately becomes tractable. Moving n disks can be viewed in terms of moving onlyn-1 disks (and hence the recursion) as follows: a) Move n - 1 disks from peg I to peg 2, using peg 3 as a temporary holding area. b) Move the last disk (the largest) from peg 1 to peg 3 c) Move the n-1 disks from peg 2 to peg 3, using peg I as a temporary holding area. The process ends when the last task involves moving 2 - 1 disk, i.e. the base case. This is accomplished by trivially moving the disk without the need for a temporary holding area, Write a program to solve the Towers of Hanoi problem. Lise a recursive function with four parameters: a) The number of disks to be moved b) The peg on which these disks are initially threaded c) The peg to which this stack of disks is to be moved d) The peg to be used as a temporary holding arca Your program should print the precise instructions it will take to move the disks from the starting peg to the destination peg. For example, to move a stack of three disks from peg 1 to peg 3, your program should print the following series of moves: 1 -> 3 (This means move one disk from peg I to prg 3.) 21 2-3