help!!

Part 1: Multiple choice and True False. Ten, 5-point questions. True or False. A Stack is the data structure used by the os to implement recursion? 2. Wh en a recursive method is called to solve a problem, the method actually is capable of solving only the simplest case(s), or a. base case (s). b. recursive call (s). c. recursion step(s). 3. T he following routine/code segment violates which rule(s) of recursion? static int recurse( int n)Iln is a positive int ifn0) return 0: else nnrecurse( n+1 return n; a. No base case b. Fails to make progress towards base case c. Does not call clone / make recursive call d. all of the above Which of the following is the most likely result of failing to make progress owards a base case in a recursive call? a. compiler enters into an infinite loop . virtual machine throws an exception when running the program . error at compilation time recursive routine enters an infinite loop when it runs In the most common scenario, what happens when method F calls method G? a. An activation record for F is pushed b. An activation record for F is popped c. An activation record for G is pushed . d. An activation record for G is popped e. none of the above Page 1 of 4