Question 3 (1 point) If a recursive method has no base case, i.e. bottom, or if the base case is never reached, it will become infinite and the result will be StackOverflowException. O True False Save Question 4 (1 point) Using recursion for a linear sequence such as Fibonacci is efficient. O True False