Consider the problem of computing an$,$ where a $>0$ and n in N$.$

A$.$ State the computational problem Exponentiation in formal In$-$

stance$/$Solution form as is done in the lecture notes.

B$.$ Write CLRS pseudocode for a divide$-$and$-$conquer algorithm for the ex$-$

ponentiation problem of computing an where a $>0$ and n is a positive

integer.

C$.$ Define and solve a recurrence for the number of multiplications made by

your algorithm.

D$.$ How does your algorithm compare with a brute$-$force algorithm for this

problem?