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

1. A binary search can only be used on a sorted array.
2. The tower function that solves the Towers of Hanoi problem has three parameters.
3. Iteration is usually more efficient than recursion.
4. If a path through a function is missing a return statement the compiler will not detect the error.
5. If error checking is done inside a recursive function it will perform more efficiently.

1. True
2. False
3. True
4. True
5. False