The ____ of a recursive algorithm is the part that continues the recursive calls.

Backtracking normally uses ______ to find out all solutions to a computational problem. (recursion, iteration).

When recursion is used to solve a problem, why must the recursive method call itself to solve a smaller version of the original problem?

A recursive function must have a to end the recursion. recursive call base case O value boolean condition

The triangle.cpp ProgramDoes recursion actually work? If you run the triangle.cpp program, you’ll see that itdoes. The program uses recursion to calculate triangular numbers. Enter a value for the term number, n, and the program will display the value of the corresponding triangular number.  show the triangle.cpp program

Simple MIPs Recursive Procedure Write a program that calls a recursive procedure. Inside this procedure, add 1 to a counter so you can verify the number of times it executes.  Put a number in a MIPS counter that specifies the number of times you want to allow the recursion to continue. You can use a LOOPinstruction (or other conditional statements using MIPS), find a way for therecursive procedure to call itself a fixed number of times.

q6

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

What is the overhead that is associated with the execution of a recursive function, both in terms of the amount of memory space that is required and the amount of time that is occupied by the computer?

Recursive function: Writing the recursive case.   Write code to complete PrintFactorial()'s recursive case. Sample output if input is 5:   5! = 5 * 4 * 3 * 2 * 1 = 120     #include <stdio.h> void PrintFactorial(int factCounter, int factValue){int nextCounter;int nextValue; if (factCounter == 0) { // Base case: 0! = 1printf("1\n");}else if (factCounter == 1) { // Base case: Print 1 and resultprintf("%d = %d\n", factCounter, factValue);}else { // Recursive caseprintf("%d * ", factCounter);nextCounter = factCounter - 1;nextValue = nextCounter * factValue; /* Your solution goes here */ }} int main(void) {int userVal; scanf("%d", &userVal);printf("%d! = ", userVal);PrintFactorial(userVal, userVal); return 0;}