Please answer Q2 and Q3 for me.

Thank

Question 2 2 pts Which of the following factors contribute to the inefficiency of some recursive solutions (check all that apply) O The overhead associated with function calls O The inherent inefficiency of some recursive algorithms O The length of code necessary to define a recursive function The maintenance costs because recursive solutions are harder to understand. Question 3 2 pts Which of the following questions should you keep in mind when constructing a recursive solution? (check all that apply) How can you define the problem in terms of a smaller problem of the same type? How does each recursive call diminish the size of the problem? What instance of the problem can serve as the base case? As the problem size diminishes, will you reach this base case