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 given two words. Input: two words A: cider B: cried Algorithm 1: First, sort input words and compare two words scanning from beginning to the end of the word array-use while loop In order to sort a word, please call sort function as shown in the following code. #include iostream> using namespace std: int main char A[]-ter.'de.YW ; int n; if the sizes of two words are not equal to each if (sizeof(A)!-sizeof B) other then exit cout