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

1. A method definition that includes a call to itself is said to be recursive.
2. When a recursive call is encountered, computation is temporarily suspended; all of the information
needed to continue the computation is saved and the recursive call is evaluated.
3. A base case must include a recursive call.
4. To keep track of recursion most computer systems us a structure called a queue.
5. A stack is a last-in/first-out memory structure.

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