1. a method is called once from a program’s main method, and then it calls itself four times. the depth of recursion is a. one b. four c. five d. nine 2. this is the part of a problem that can be solved without recursion. a. base case b. solvable case c. known case d. iterative case 3. this is the part of a problem that is solved with recursion. a. base case b. iterative case c. unknown case d. recursion case 4. this is when a method explicitly calls itself. a. explicit recursion b. modal recursion c. direct recursion d. indirect recursion 5. this is when method a calls method b, which calls method a. a. implicit recursion b. modal recursion c. direct recursion d. indirect recursion 6. this refers to the actions taken internally by the jvm when a method is called. a. overhead b. set up c. clean up d. synchronization 7. true or false: an iterative algorithm will usually run faster than an equivalent recursive algorithm. 8. true or false: some problems can be solved only through recursion. 9. true or false: it is not necessary to have a base case in all recursive algorithms. 10. true or false: in the base case, a recursive method calls itself with a smaller version of the original problem.