Write a function that uses recursion to raise a number to a power. The function should accept two arguments, the number to be raised and the exponent. Assume that the exponent is a nonnegative integer. Show that this function works correctly for several values.

#include using namespace std;

int power (int x, int n);

int main() {

//declaration of variables int base; int exponent, pow;

cout<<"Enter a base value: "; cin>>base; cout<<"Enter an exponent value: "; cin>>exponent; cout<

// Functions for x and n int power(int x, int n) { if(n ==0) return 1; else return x * power(x, n -1); } //end

How do I make this show that this function works correctly for several values.