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. need to include code from picture

****FILL IN CODE FROM THE PICTURE****

adl 88%. 3:08 PM Question nps are said to be anagrams of each ather if the first string's letters can be rearranged t to form the second string, In uther words, both strings must contain tbe same exaet letters in the satue exact frequeney. For exatcple, iceman and cinema, danger and garden, and leaf and flea are anagrans Given tho sirings, s, and s, that may ur may not be of the same iength, write a C++ program in the torin shown on the back page that returns true if two words are anagrams. Test your ode for a varicty of words. Show your compiere code vo the bock pupe. Demoestration of the pragram develaped to your instructor hefore leing is r nclude atuteanents hool arcAnagrams (cunsi seringk si, eonst string& s2 countCharacters feomet atringd si, int count(l irnet moin X coxd s1ss and"