Algorithm. No code needed

3. a. Write pseudocode for a divide-and-conquer algorithm for the exponenti- ation problem of computing a" where n is a positive integer. b. Set up and solve a recurrence relation for the number of multiplications made by this algorithm As we shall see in Section 11.2, this theoretical minimum is [log2 n!l n log -1.44n1. 5.1 Mergesort 175 c. How does this algorithm compare with the brute-force algorithm for this