Problem 1: compute the exponent of a number.

Input: User inputs the base and exponent, named x and n.

Output: print out the value of xⁿ and how many multiplications which have been executed. How fast can you implement this job (in terms of smallest number of multiplications)?

Test your program on the following five inputs and print out the output for each input.

Input 1: 2 8

Input 2: 0.2 7

Input 3: 6.2 32

Input 4: 2 64

Input 5: 2 63

Problem 2: Insertion Sorting.

We can express insertion sort as a recursive procedure as follows. In order to sort A[1..n], we recursively sort A[1..n-1] and then insert A[n] into the sorted array A[1..n-1]. Write a recursive solution.

Input: 1. User input the number of integers to be sorted, named n.

2. User input n integers.

Output: print out the sorted integers with space between numbers.

Test your program on the following five inputs and print out the output for each input.

Input 1: 1 2 3 4 5 6 7 8

Input 2: 8 7 6 5 4 3 2 1

Input 3: 1 3 5 7 2 4 6 8

Input 4: 5 6 7 8 1 2 3 4

Input 5: 7 8 2 4 1 6 5 3

Note: since the size of the array is one of the inputs, please use dynamic array instead of static array i want answer for the 2nd problem programing language c++