two strings are said to be anagrams of each other if the first strings letters can be rearranged to form the second string. both string must contain the same exact letters in the same exact frequency. given s1 and s2, that may not be the same length. write c++ program in the form shown on the back page that returns true it two words are anagrams. plz compete the code on the picture and write comments to explain

// include statements # include # include using namespace std; bool areAnagrams (const string& si, const string& s2); countCharacters (const string& s1, int countD int main (X string s1, 52 cin >>s1>>82; areAnagrams (si, s2)){ cout