please

Which of the following statements is correct about a recursive function? A recursive function must call another function. A recursive function calls itself. A recursive function must be simple. A recursive function must never call another function. Question 2 Which of the following is true about using recursion? A recursive computation solves a problem by calling itself with simpler input. A recursion eventually exhausts all available memory, causing the program to terminate. Recursion always helps you create a more efficient solution than other techniques. None of the listed options. How can you ensure that a recursive function terminates? Provide a special case for the most complex inputs. Provide a special case for the simplest inputs. Call the recursive function with simpler inputs. Use more than one return statement