Please use C++!

We want to write a recursive solution for and prove that it is correct where n >= 1

• What is the base case?
• Prove that the recursive case for this function is correct

eq(int n) {

// base case here ....

// recursive case here

return n * pow(2, n) + eq(n-1)

* 2' = 2 + ( 1) 21+1 21. -1