2. Anagram A string is an anagram of another if its letters can be rearranged to produce the other string. For example,

[answerhappygod]

2. Anagram
A string is an anagram of another if its letters can berearranged to produce the other string. For example, "forty five"is an anagram of "over fifty".
Write a program that checks whether two strings given on thecommand line are anagrams. You should not use any sorting method.You can assume the strings will only contain letters (a – z, A – Z)and spaces.
Examples
Please write in java and provide screenshot of output