This is a c programming question. Please use stdio.h and string.h and libraries only. Thank you!

Question:

Write a function that tests whether two word are anagrams. Two words are anagrams if they're permutations of the same letters. For example, smartest and mattress are anagrams, while dumbest and stumble are not. Assume word1 and word2 are null-terminated strings containing arbitrary characters. The function returns 1 if the two words are anagrams and returns 0 otherwise. Hint: Use an array of 26 integers to keep track of how many times each letter is in a word.

Function prototype:

int is_anagram(char *word1, char *word2)

{

18 Watch the white www www.Twordenagih Forcement otherwise. Hintse muerty of egen ekspack of how many times each tar a Ins_naranchar words, chat words