Sorting the stack recursively

Ritik is stuck on a problem for the past few days. He has a stack 'S' of integers and his friend told him to sort the stack recursively.

Help Ritik to solve his problem so that he can show it off to his friend.

Note:

1. Looping through the stack is not allowed.
2. You need to return a stack that is sorted in descending order.

For example:

Given stack 'S' = 1 3 2 
The output will be 3 2 1 since it is the sorted order.

Input format :

The first line of input contains an integer ‘T’ denoting the number of test cases.

The second line of each test case contains a single integer ‘N’, denoting the stack size.

The next line contains ‘N’ space-separated integers denoting the elements of the stack, the last element of the input being the top of the stack.

If the input is 1 3 2 then the input stack will look like this :

Output format :

For each test case, print a single line containing space-separated integers denoting the stack elements in descending sorted order.

The output of each test case will be printed in a separate line.

Note:

You do not need to print anything. It has already been taken care of. Just implement the given function.

Constraints:

1 <= T <= 5
1 <=  N <= 2000
0 <= S[i] <= 1000

Where ‘T’ is the total number of test cases, and 'N’ is the size of the stack, and 'S[i]' is the element of the stack.

Time limit: 1 sec.