a recursive equation:

T(n) = T(n - 1) + T(1) + T(n - 1)

its base case conditions:

T(0) = 0

T(1) = 1

It has three recursive calls, and a base case that performs a single command when it is used.

The actual solution to this recursive equation is the found in the following way:

T(2) = T(2 - 1) + T(1) + T(2 - 1) = 1 + 1 + 1

T(3) = T(3 - 1) + T(1) + T(3 - 1) = T(2) + T(1) + T(2) = 3 + 1 + 3

T(4) = T(4 - 1) + T(1) + T(4 - 1) = T(3) + T(1) + T(3) = 7 + 1 + 7

T(5) = T(5 - 1) + T(1) + T(5 - 1) = T(4) + T(1) + T(4) = 15 + 1 + 15

In C++ code write a function called solveTripleCounter() that takes a single integer parameter that is greater than or equal to 0 and returns the value of the formula for T(n) using a recursive calling and programming logic structure. The method should return an int value that is equal to the value of T(n). This function need not be in an object. It should be called by your program's main() function. Once again, the main() function should be of the int data type and should have the values stored in a variable which can be used as the parameter to your solveTripleCounter() method.

As a part of the comments for solveTripleCounter() provide a comment that explains what the algebraic equation is for n. That is, write the regular, non-recursive, equation that shows how T(n) is related to the value of n. The equation has as a number raised to the power of n in it, and also a subtraction of a constant number in it.

solveTripleCounter() is a stand alone function. It should be called by your program's main() function. The main() function should be of the int data type, and should be used to pass the value of the parameter needed to solveTripleCounter(). The main() function should end after the solveTripleCounter() function has completed. Use hardcoded values for a single integer value used in main() that is passed as the parameter to solveTripleCounter().