Consider the following recursive algorithm.ALGORITHM Q(n)//Input: A positive integer nif n = 1 return 1else return Q(n − 1) + 2 ∗ n − 1a. Set up a recurrence relation for this function’s values and solve it to deter-mine what this algorithm computes.b. Set up a recurrence relation for the number of multiplications made by thisalgorithm and solve it.c. Set up a recurrence relation for the number of additions/subtractions madeby this algorithm and solve it.

Recurrence equations describing the work done during recursion are only useful for divide and conquer algorithm analysisQuestion 10Select one:TrueFalse

A recursive algorithm must:

1) What is the primary concept behind recursiona) Creating complex algorithmsb) Breaking down a problem into smaller, simpler sub-problemsc) Repeating a process infinitelyd) Eliminating all errors in a program

Which of the following pseudo code snippets correctly calculates the sum of numbers from 1 to n using recursion?

For each of the following algorithms, indicate (i) a natural size metric for itsinputs, (ii) its basic operation, and (iii) whether the basic operation count canbe different for inputs of the same size:a. computing the average of n numbersb. computing n/n!c. finding the smallest element in a list of n numbersd. reverse display a list of n numberse. reverse a list of n numbersf. pen-and-pencil algorithm for adding two n-digit decimal integers