In C program Write a recursive function add(m,n)that computes the sum of its two integer parametersmand n. Assume add()does not know general addition tables but does know how to add or subtract 1. Hints: Simple case is:if(n==0) thenanswer= malsom + n = 1 + (m + n -1)

describe a recursive function that cannot be rewritten as non recursive

Write a recursive function to see if the first letter matches the last letter, return the middle letters and check until only 0 or 1 letters are left. It returns True or False. Here is the original code that needs to be checked: # Returns the first character of the string str def firstCharacter(str):     return str[:1] # Returns the last character of a string str def lastCharacter(str):     return str[-1:] # Returns the string that results from removing the first #  and last characters from str def middleCharacters(str):     return str[1:-1] def isPalindrome(str):     # base case #1     # base case #2     # recursive case     pass   Python code

Why does dynamic programming provide faster solutions that recursive algorithms solving the same problem? 1.avoids resolving overlapping subproblems   2.dynamic programming uses dynamic memory that is more efficient than stack memory   3.loops are always faster than recursion   4.dynamic uses arrays that are faster than function calls

Identify the bug in the following recursive function. def sumSquare(numList): if len(numList) : 1: == print numList[0]*+2 else: return numList[0] * +2 + sumSquare(numList[1:]) Syntax error in the last line. Results in an infinite recursion. The else should be elif The == in the if statement should be >= The base case doesn't return anything.

SML programming Write a recursive function np(n) which takes a non negative n and  generates a list of numbers from n+1 down to 0. You may assume that input of n is always valid. Must use identical function name and parameter(s). np(4)⟶[5,4,3,2,1,0]

Identify the base case in this recursive function. Assume i> 0 when the function is invoked. (Line numbers are not part of the code.) 1. def add(i, j): 2. if i == 0: 3. return j 4. else: 5. return add(i - 1, j + 1) This function has no base case O line 5 line 1 line 4 O line 2 Question 6 The following recursive function is supposed to return a list that is the reverse of the list it was given. But it has a bug. What is the bug? (Line numbers are not part of the code.) MooP eok Dr

2. Consider the following function: def func1(n): output = 1 for i in range (1, n) : output = i return output Rewrite the function as a recursive function.

Write a statement that calls the recursive function backwards_alphabet() with input starting_letter.

Write the recursive function based on the following formula in Visual Basic code: if n=0 f(n) = 1 if n = 1 F(n- 1) + F(n – 2) if n>1