Problem StatementErin, a mathematician wants to calculate the sum of squares of the first n Triangular numbers. Write a recursive function called TotalSumOfSquares to help Erin that takes the input for n and outputs the sum of squares of the first n Triangular numbers.The formula to calculate the nth Triangular number is Tn = (n * (n+1)) / 2.ExampleIf n=4, the calculations are as follows:T1 = (1 * (1+1)) / 2 = 1T2 = (2* (2+1)) / 2 = 3T3 = (3 * (3+1)) / 2 = 6T4 = (4 * (4+1)) / 2 = 5So the sum of squares of first 4 triangular numbers = 12 + 32 + 62 + 52 = 1 + 9 + 36 + 100 = 146Input format :The input consists of an integer n, representing the number of triangular numbers to consider.Output format :The output prints an integer representing the sum of squares of the first n Triangular numbers.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:1 ≤ n ≤ 50Sample test cases :Input 1 :4Output 1 :146Input 2 :29Output 2 :1212751

The problem statement is asking to write a recursive function that calculates the sum of squares of the first n Triangular numbers. A Triangular number is calculated using the formula Tn = (n * (n+1)) / 2.

Here is a step-by-step solution:

1. First, we need to understand what a triangular number is. A triangular number is a number that can form an equilateral triangle. The dot representation will form an equilateral triangle. The nth triangular number is the number of dots in the triangular arrangement, which is the sum of the first n natural numbers.

2. The formula to find the nth triangular number is Tn = n * (n + 1) / 2.

3. We are asked

The problem is asking to write a recursive function that calculates the sum of squares of the first n Triangular numbers. A Triangular number is calculated using the formula Tn = (n * (n+1)) / 2.

Here is a step-by-step guide on how to solve this problem:

Step 1: Understand the problem. We need to calculate the sum of squares of the first n Triangular numbers.

Step 2: Write a recursive function. The base case of the function will be when n is 0, in which case the function should return 0.

Step 3: For each recursive call, calculate the nth Triangular number using the formula Tn = (n * (n+1)) / 2.

Step 4: Square the result of the Triangular number calculation and add it to the result of the recursive call for n-1.

Step 5: The function should return the sum of squares of the first n Triangular numbers.

Here is a Python code snippet that implements the above steps:

def TotalSumOfSquares(n):
    if n == 0:
        return 0
    else:
        Tn = (n * (n+1)) / 2
        return Tn**2 + TotalSumOfSquares(n-1)

This function works by recursively calculating the sum of squares of the