QUESTION # 27 5.5.022

27. 5.5.022. Test Algorithm 5.19 for solving the Towers of Hanoi puzzle in the case of n = 3 disks using a top-down evaluation. Hanoi(3, 1, 3) = Hanoi(2, 1, 2), (1,3), Hanoi(2, 2, 3) = Hanoi(1, 1, 3), (],) , Hanoi(1, 3, 2), (1, 3), Hanoi(1, 2, 1), (2, 3), Hanoi(1, 1, 3)