<prompt> Ngola algorithm e lemohang li-anagrams.nan  <response>: Instruction in English: Write an algorithm that detects anagrams. . Response in English: Here is an algorithm that detects if two given strings are anagrams:1- Begin by defining a function is_anagram with two input parameters: string1 and string2.2- Inside the function, start by removing any spaces or special characters from both strings using a regular expression, and convert all letters to lowercase. This step will ignore differences in capitalization or white spaces.3- Check if the length of both cleaned strings is equal. If not, return False since two strings of different lengths cant be anagrams.4- Next, create a frequency dictionary for each string. Initialize an empty dictionary dict1 and dict2 for each string.5- Loop through each character in string1, and add the character to dict1 as the key while the value will be the number of occurrences of that character. Repeat the same process for string2.6- Now, compare both dictionaries. If they are equal, then both strings are anagrams of each other. Return True. Otherwise, return False.7- End of function.The time complexity of this algorithm is On where n is the length of the strings since we have to loop through each character in the strings. . Response in Sesotho: Mona ke algorithm e lemohang hore na likhoele tse peli tse fanoeng ke anagrams: 1- Qala ka ho hlalosa tšebetso ke_anagram e nang le liparamente tse peli tsa ho kenya: string1 le string2. 2- Ka hara tsebetso, qala ka ho tlosa libaka kapa litlhaku tse khethehileng likhoeleng ka bobeli u sebelisa polelo e tloaelehileng, me u fetole litlhaku tsohle hore e be litlhaku tse nyane. Mohato ona o tla iphapanyetsa liphapang tsa capitalization kapa libaka tse tšoeu. 3- Sheba hore na bolelele ba likhoele tse hloekisitsoeng ka bobeli bo lekana. Haeba ho se joalo, khutlisetsa Bohata kaha likhoele tse peli tsa bolelele bo fapaneng li ke ke tsa ba anagrams. 4- E latelang, theha dikishinari ea khafetsa bakeng sa khoele ka ngoe. Qala bukantswe e se nang letho dict1 le dict2 bakeng sa thapo ka nngwe. 5- Lula ka hara sebapali se seng le se seng ho khoele1, me u kenye sebopeho ho dicte1 e le senotlolo ha boleng e tla ba palo ea liketsahalo tsa sebapali seo. Pheta tsebetso e tsoanang bakeng sa khoele2. 6- Joale, bapisa lidikishinari ka bobeli. Haeba li lekana, joale likhoele ka bobeli ke li-anagrams tsa tse ling. Khutlisa Nete. Ho seng joalo, khutlisetsa Bohata. 7- Qetello ea tsebetso. Ho rarahana ha nako ea algorithm ena ke On moo n e leng bolelele ba likhoele kaha re tlameha ho thella hara sebapali ka seng likhoeleng. 