The following recursive equation:

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

with the following base case conditions:

T(0) = 0

T(1) = 1

has a programming solution that works very similar to the structure of the solveTowers() algorithm from1a.It too 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

.

.

.

Writes a method 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 like that used in1a. it should return an int value that is equal to the value of T(n).solveTripleCounter() should be included inside a class you provide named TripleCallCounter and should have a public static void main() method.The main() method should be used to pass the value of the parameter needed to solveTripleCounter(), and should end after the solveTripleCounter() once method has completed.Use hardcoded values for a single integer value used in main() that is passed as the parameter to solveTripleCounter().

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.Hint:the equation has as a number raised to the power of n in it, and also a subtraction of a constant number in it.