Answer:
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.
