Two words are **anagrams** if they contain exactly the same letters the same number of times, in any order (for example `listen` and `silent`). Write a program that inputs two words made only of lowercase letters (a-z), which may be different lengths. Output `Anagram` if they are anagrams of each other, otherwise output `Not anagrams`. Hint: use an array of 26 counters, one for each letter. The ASCII code for `a` is 97.