Anagram checking Design an algorithm for checking whether two pivern 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 twe algorithms for checking anagram for given Input: two words A: cider B: cried Algonithm 1: First, soet isput words and compare two weeds scanning from beginning to the end of the woed array - us wie loop In order to sort a word. plcase call ser function as shown in the following code. finclude ciostream> using namespace sod int main if (suzeollA) !-sizcotIB)) t ether then exit ifthe sucs of two words are not equal to each cout