(a)
1. Create an empty array of size 26 to represent the 26 letters in the English alphabet.
2. For each letter in the first word, increment the corresponding index in the array by 1.
3. For each letter in the second word, decrement the corresponding index in the array by 1.
4. Iterate through the array and check if all the values are zero. If they are, return true. If not, return false
(b)
AnagramChecker.java