DIY: Pow(x, n)

Problem statement

For this problem, you are given an integer base and power value. You have to implement the pow() function, which will raise the base to a specified power and return its value.

Assume the following constraints:

• -100 < base < 100
• -$2^{31}$ <= power <= $2^{31}$-1
• -$10^4$ <= $x^{n}$ <= $10^4$, where x* is the baseand *n* is thepower`.

Input

The pow() function will take two inputs: base and power, and it will call the quickPow() function recursively, which will take two inputs: base and power / 2. Here is an example of the inputs:

base = 2
power = 4

Output

The pow() function returns the base raised to a specified power. The following is the output of the inputs shown above:

16

Coding exercise

You need to implement the pow() function in the skeleton code given below.