Answer the following statements true (T) or false (F)

1) In the Towers of Hanoi puzzle, it is legal to move a larger disk to a peg that already contains a smaller disk.
2) The Towers of Hanoi puzzle cannot be solved iteratively.
3) Determining whether or not there is a path through a maze has a recursive solution.
4) A program with infinite recursion will act similarly to a program with an infinite loop.
5) Recursive solutions are always more efficient than iterative solutions

1) F
2) F
3) T
4) F
5) F