Two strings are said to be anagrams of each other if the first strings letters can be rearranged to form the second string. In other words, both strings must contain the same exact letter in the same exact frequency. For example, iceman and cinema, danger and garden, and leaf and flea are anagrams.

Given two strings, s1 and s2, that may or may not be of the same length, write a c++ program in the form shown on the back page that returns true if two words are anagrams. Test your code for a variety of words.

// include statements einclude ciostream einclude estring> using namespace std bool areAnagrams (const string& s1, const string& s2) countCharacters (const string& s1, int count[D; int main )X string s1, s2; if (areAnagrams (si, s2)X cout