There is a board with three pegs and three disks of different sizes (see Figure 1). The goal of the game is to move the three disks from the peg where they have been placed (largest disk on the bottom, smallest disk on the top) to one of the empty pegs, subject to the following constraints: a. Only the top disk on a peg can be moved to another peg. b. A larger disk cannot be placed on top of a smaller disk. n=3 L M R Figure 1: Towers of Hanoi Design an algorithm to handle the Towers of Hanoi problem. (20 Marks)