complete the code please

Two strings are said to be anagrams of each other if the first string's letters can be rearranged to form 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 sa, 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