Solve

Question 9 (1 point) Listen It always is possible to replace a recursion by an iteration and vice versa. True False Question 10 (1 point) () Listen If one were to create a Towers of Hanoi puzzle with four towers instead of three, with rules changed appropriately, it should be possible to create a recursive solution for the puzzle where one of the constraints is that at some point during the solution all of the disks must reside on each of the four towers. True False