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 Algorithm1: 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 sortO function as shown in the following code. #include #include-bitsstde++.h> using namespace std: int maino int n if (sizcofiA)-sizcof(B)if the sizes of two words are not equal to cach other then exit endl; cout