Write pseudocode for a divide-and-conquer algorithm for the exponentiation problem of computing a n , where n is an integer ( 1) and a power of 2 and a is a non-zero real number. (3.2) Set up and solve a recurrence relation for the number of multiplications made by this algorithm. (3.3) How does this algorithm compare with the brute-force algorithm for this problem?