BETA

Difficulty Level: Basic

Submissions: 2758 Accuracy:

42.46%

Sort a String
       

Given a string S consisting of lowercase latin letters, arrange all its letters in ascending order. 

Input:

The first line of the input contains T denoting number of testcases.Then follows description of each testcase.The first line of the testcase contains positive integer N denoting the length of string.The second line contains the string S.


Output:

For each testcase,output the sorted string.


Constraints:

1<=T<=100
1<=N<=100


Example:

Input:
1
5
edcab

Output:
abcde

** For More Input/Output Examples Use 'Expected Output' option **

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.