Are Anagrams (C#) : Algorithm

An anagram is a word formed from another by rearranging its letters, using all the original letters exactly once; for example, orchestra can be rearranged into carthorse.

Write a function that checks if two words are each other's anagrams.

For example, AreStringsAnagrams("momdad", "dadmom") should return true as arguments are anagrams.

Code Snippet

17.  
18. class Program
19. {
20.     public static bool AreStringsAnagrams(string a, string b)
21.     {
22.         if (String.IsNullOrEmpty(a) || String.IsNullOrEmpty(b))
23.             return false;
24.         else if (a.Length != b.Length)
25.             return false;
26.         else if (a.Equals(b))
27.             return true;
28.         else
29.             return a.OrderBy(x => x).SequenceEqual(b.OrderBy(x => x));
30.  
31.     }
32.  
33.     public static void Main(string[] args)
34.     {
35.         Console.WriteLine(AreStringsAnagrams("momdad", "dadmom"));
36.         Console.ReadLine();
37.     }
38. }