Problem:
Question 1- Write pseudocode for a divide and conquer algorithm for the exponentiation problem of computing a^n where a > 0 and n is a positive integer.
Question 2- Set up and solve a recurrence relation for the number of multiplications made by this algorithm.
Question 3- How does it compare with the brute-force algorithm for this problem?
Step by step instructions so I can understand would be greatly appreciated!