3. In Lecture 5, we discussed how to solve the Tower of Hanoi problem (Exercise 5.36 in the textbook) Consider the following problem variant in which one extra constraint has been added: There are three pegs and n disks of different sizes. Initially, all disks are on the leftmost peg and arranged in order of decreasing size, with the smallest disk on top. The task is to move all the disks to the rightmost peg, under the constraints that Only one disk can be moved in each step; . Direct moves between the leftmost peg and the rightmost peg are not allowed; and . A larger disk may never be placed on top of a smaller disk