Check Whether Two Words Are Case-Insensitive Anagrams

Given two strings, word_a and word_b, determine whether they are anagrams when letter case is disregarded. Two words are anagrams if the multiset of their letters matches exactly; the order of the letters does not matter. Implement is_anagram(word_a, word_b) -> bool, returning true only when the case-insensitive letter frequencies are identical. A repeated letter must appear the same number of times in both words, not merely be present in both. Both inputs are always strings…