Write a C program Towers of HanoiEvery budding computer scientist must grapple with certain classic problems, and the Towers ofHanoi (see Figure below) is one of the most famous of these. Legend has it that in a temple in theFar East, priests are attempting to move a stack of disks from one peg to another. The initial stackhad 64 disks threaded onto one peg and arranged from bottom to top by decreasing size. The priestsare attempting to move the stack from this peg to a second peg under the constraints that exactlyone disk is mo ved at a time, and at no time may a larger disk be placed above a smaller disk. Athird peg is available for tempoholding the disks. Sujdly the world will end when thepriests 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 todevelop an algorithm that will print the precise sequence of disk-to-disk peg transfers. If we wereto approach this problem with conventional methods, we would rapidly find ourselves hopelesslyknotted up in managing the disks. Instead, if we attack the problem with recursion in mind, itimmediately becomes tractable. Moving n disks can be viewed in terms of moving only n – 1 disks(and hence the recursion) as follows:a) Move n – 1 disks from peg 1 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 1 as a temporary holding area.The process ends when the last task involves moving n = 1 disk, i.e., the base case. This isaccomplished by trivially moving the disk without the need for a temporary holding area. Write aprogram to solve the Towers of Hanoi problem. Use a recursive function with four parameters:a) The number of disks to be movedb) The peg on which these disks are initially threadedc) The peg to which this stack of disks is to be movedd) The peg to be used as a temporary holding areaYour program should print the precise instructions it will take to move the disks from the startingpeg to the destination peg. For example, to move a stack of three disks from peg 1 to peg 3, yourprogram should print the following series of moves:1 -> 3 (This means move one disk from peg 1 to peg 3.)1 -> 23 -> 21 -> 32 -> 12 -> 31 -> 3

Name: Write a C program Towers of HanoiEvery budding computer scientist must
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Write a C program Towers of HanoiEvery budding computer scientist must grapple with certain classic problems, and the Towers ofHanoi (see Figure below) is one of the most famous of these. Legend has it that in a temple in theFar East, priests are att