Please help in C++.

Thank you..

Problem 1: compute the exponent ofa mumber. Input: User inputs the base and exponent, named x and r Outpet: 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 mumber of Test your peogram on the following five inputs and print out the output for each input Input 1: 28 Input 2: 0.27 Input 3: 62 32 aput 4: 264 Input 3: 2 63 Problem 2: Insertion Sorting We can express insertion sort as a recursive procedure as follows, In order to sort All-al, wrecursively sort All..n-11 and then insert AlnI into the sorted array AI.-1. Write a recursive solution. Iaput 1. User input the number of integers to be sorted, named 2 User input n inteers 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: 12345678 Input 2:87654321 Input 3: 13572468