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

Tw o strings are said to be anagrams of each other if the first string's letters can be rearranged to torm the second string. In other words, both strings must contain the same exact letters in the same exact frequency. For example, iceman and cinema, danger and garden, and leaf and flea are anagrams. Given two strings, s, 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. Show your complete code on the back page. Demonstration of the program developed to your instructor before leaving is required