In C++, write a recursive function power that takes two positive integers base and n as inputs and computes base to the n power. Example power(3, 2) is 9. Do not use any loops in your program. This is what I got so far but I'm not sure what I'm doing wrong:

#include using namespace std; int calc(int x, int y); int main() { calc(2, 3);

return 0; } int calc() {

cout << calc(int x, int y) << " ";

}