please do this in c++. thank you

Anagram checking Design an algorithm for checking whether two given words are anagrams, Le, whether one word can be obtained by permuting the letters of the other. (For example, the words tea and eat are anagrams Please write a code to test two algorithms for checking anagram for gives twe words. Input: two words A: cider B: cried Algorithm 1: First, soet imput words and compare two woeds scanning from beginning to the end of the word array - use while loop In order to sort a word. please call sernO function as shown in the following code #include ostream? include ditsstdc++) using namespace std int main) int n if (sizcoRA)-sizolB) other then exit if the sizes of two wonds are not equal to cach cout > choice ifichoice-1) e