3. write a recursive algorithm of the sequence t(1)=1 and t(n)=n2 t(n-1) as a function.

int t(int n){

     if(n == 1)

          return 1;

     else

          return n*n*t(n-1);

}

Step-by-step explanation:

A recursive function is a function that calls itself.

I am going to give you an example of this algorithm in the C language of programming.

int t(int n){

     if(n == 1)

          return 1;

     else

          return n*n*t(n-1);

}

The function is named t. In the else clause, the function calls itself, so it is recursive.

this is not the answer this is just a question. is this middle school math?

step-by-step explanation: