b. 3,6,2,1, +, 5, X, 4,- Illustrate the tree of recursive calls for the tower of Hanoi played with 4 disks, with 3 the following change of rules: Two disks can be moved together, and a larger disk cannot be placed on a smaller disk. (Number moves correctly.)