Which of these is false about recursion?OptionsRecursive function can be replaced by a non-recursive functionRecursive functions usually take more memory space than non-recursive functionRecursive functions run faster than non-recursive functionRecursion makes programs easier to understand

Select the correct answer Which of these is not true about recursion?OptionsRecursive functions are easy to debugIt’s easier to code some real-world problems using recursion than non-recursive equivalentRecursive calls take up a lot of memoryPrograms using recursion take longer time than their non-recursive equivalent

Which of the following statements is true?ans.Recursion uses less memory compared to iterationRecursion is always better than iterationRecursion uses more memory compared to iterationIteration is always better and simpler than recursion

Select the correct answerWhich of the following statements is false about recursion?OptionsA recursive function makes the code easier to understandInfinite recursion can occur if the base case isn’t properly mentioned Every recursive function must have a base caseEvery recursive function must have a return value

Which of the following statements is TRUE?Group of answer choicesRecursion is ALWAYS more efficient than iteration.Recursion NEARLY ALWAYS uses more memory compared to iteration when it executes.A recursive method must ALWAYS contain a loop.Iteration is ALWAYS more efficient AND simpler than recursion.

Both time and space complexities are better in recursive than in non-recursive program.Both time and space complexities are better in non-recursive than in recursive program.Time complexity is better in recursive version but space complexity is better in non-recursive version of the program.Space complexity is better in recursive version but time complexity is better in non-recursive version of the program.