How many times is the recursive function called, when the following code is executed? void my_recursive_function (int n) if(n =- 0) return; printf("%d ",n); my_recursive_function(n-1); } int main() { my_recursive_function(10); return 0;

A recursive function must have a to end the recursion. recursive call base case O value boolean condition

Identify the base case in this recursive function. Assume i> 0 when the function is invoked. (Line numbers are not part of the code.) 1. def add(i, j): 2. if i == 0: 3. return j 4. else: 5. return add(i - 1, j + 1) This function has no base case O line 5 line 1 line 4 O line 2 Question 6 The following recursive function is supposed to return a list that is the reverse of the list it was given. But it has a bug. What is the bug? (Line numbers are not part of the code.) MooP eok Dr

Simple MIPs Recursive Procedure Write a program that calls a recursive procedure. Inside this procedure, add 1 to a counter so you can verify the number of times it executes.  Put a number in a MIPS counter that specifies the number of times you want to allow the recursion to continue. You can use a LOOPinstruction (or other conditional statements using MIPS), find a way for therecursive procedure to call itself a fixed number of times.