Description

An anagram of a string is another string that can be formed by rearranging the letters of the original string.
For example: The anagram of ACM could be
1.ACM
2.AMC
3.CAM
4.CMA
5.MAC
6.MCA
Note that the length of the anagram is same as that of the original string and the frequency of each character is unaltered. That is, ACMM is not an anagram of ACM.
You have to write a program that determines whether two strings are anagram of each other.
Input Format
The first of line of the input will contain an integer T that determines the number of test cases. Each of the following T lines will contain two strings (uppercase only). The length of the strings will not be more than 100. Constraints empty
Output Format
For each line of input you have to produce one line of output. If they are anagrams output ‘yes’ otherwise print ‘no’.
Follow the sample output for exact format
Sample Input 0

Sample Output 0

1/1