Select the correct answerWhat is tail recursion?OptionsA function where the recursive functions leads to an infinite loopA recursive function that has two base casesA recursive function where the function doesn’t return anything and just prints the valuesA function where the recursive call is the last thing executed by the function

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

Select the correct answer Observe the following Python code?def a(n): if n == 0: return 0 else: return n*a(n - 1)def b(n, tot): if n == 0: return tot else: return b(n-2, tot-2)Optionsb() is tail recursive but a() isn’t Both a() and b() are tail recursive Both a() and b() aren’t tail recursivea() is tail recursive but b() isn’t

What is the base case in a recursive function? Marks : 1Negative Marks : 0Answer hereThe last condition in the functionThe first condition in the functionA condition that stops the recursionThe condition with the highest value

In a recursive function, when is the recursive call executed? Marks : 1Negative Marks : 0Answer hereBefore any other statementsAfter the base case checkAfter the return statementRandomly during execution

Which of the following function calls lead to infinite recursion in the below code?def fun(a):    if(a==0):        return 0    return a*fun(a-1)*fun(0)fun(9)fun(-3)None of these