Answer the following: Please show the steps and explain. Question A of the pseudocode notation should be written and answered like the screenshot below.

A. Write a recursive brute force algorithm using correct pseudocode notation and style that calculates aⁿ.

B. What is the recurrence relation for the number of multiplications?

C. Solve the recurrence relation. What is the efficiency class of the algorithm?

Pseudocode of Insertion Sort ALGORITHI InsertionSort (A[0..n1]) //Sorts a given array by insertion sort // Input: An array A[0..n1] of n orderable elements // Output: Array A[0..n1] sorted in nondecreasing order for i1 to n1 do vA[i] ji1 while j0 and A[j]>v do A[j+1]A[j] jj1 A[j+1]v