Recursively Implement Pow Write a recursive function that will calculate a number raised to the n power. The function should support negative powers. There is a simple O(n) implementation, but the problem can be solved in O(log n). A slight modification to the O(n) algorithm can make it run in O(log n).The function must be recursive, no loops are allowed. DO not use the math library. Examples Input of 2.1000 raised to 3 will produce 9.26100 Input Do not read in input! There will be no input read in anymore. Going forward use the hard-coded input on the template and ensure the program works. There will be one compare output test based on the hard-coded input. The rest of the tests will be unit tests. Output Print the results from your function

use these functions

// Include the necessary header files

double Pow(double num, int power) { /* Always start with the base case. If you were computing square root of a number there are two cases when you will always know what the result is. One case is when the power is 0. You must also deal with the case of n being negative. Remember 2^-2 is 1/(2^2).

*/ }

int main(){

double num = 4.1; int power = 5; // Call your function // Print your results from your function

return 0; }