Check the jumbled words This is an easy one.

Anagrams are words which have the same characters but in different order. All you have to do is to figure out if two strings are anagram or not.

Rules:


Take two strings as a function argument, command-line argument or from standard input.
Write a function or program which returns truthy value if strings are anagram, falsy value otherwise
Anagrams may have different number of spaces () characters in them.
Anagrams are case insensitive matches.
Anagrams can only have printable ASCII characters for this code-golf.


For example(taken from the Wikipedia page itself): Doctor Who is an anagram of Torchwood . Note missing space and lack of capital D and W in Torchwood

This is code-golf so minimum bytes code win!

Happy golfing.
Java, 146 131 144 134 131 128

Not a very exciting answer. Returns true for anagrams, false for others. Actually works now. Cheapass abuse of generics in class declaration.

boolean b(T a,T b){return c(a).equals(c(b));}T c(T a){char[]c=a.toLowerCase().toCharArray();sort(c);return(T)valueOf(c).trim();}


Ungolfed: 

boolean b(T a,T b) {
    return c(a).equals(c(b));
}

T c(T a) {
    char[] c = a.toLowerCase().toCharArray();
    sort(c);
    return (T) valueOf(c).trim();
}