You will be given N number of strings. You have to find the lexicographically smallest string and the lexicographically largest string among these strings.
The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. The first line of each test case consists of N. In the next line are N space separated strings of lower case Latin letters only.
Corresponding to each test case, in a new line, print the lexicographically smallest string and the lexicographically largest string among the given strings separated by a single space between them.
1 ≤ T ≤ 100
1 ≤ N ≤ 100
1 ≤ Length of each string ≤ 40
a ab abc
a a b
z xy t
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.