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

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.

In divide & conquer strategy, problems are usually solved recursively.

Which of the following is a Divide and Conquer algorithm?

Steps in Divide and conquer process that takes a recursive approach is said to be:a.Divide or Breakb.Both Divide or Break and Merge or Combinec.Merge or Combined.Conquer  or Solve

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