<prompt> Ho fanoe ka likhoele tse peli, A le B, ngola lenaneo ho fumana hore na likhoele tse peli ke anagrams.Khoele A: rat Khoele B: tar  <response>: Instruction in English: Given two strings, A and B, write a program to determine whether the two strings are anagrams. . Response in English: An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Heres a python program to check whether two strings are anagrams of each other:pythondef areAnagramsstr1, str2: Get lengths of both strings n1 lenstr1 n2 lenstr2 If the lengths of both strings are not the same, return false if n1 ! n2: return False Sort both strings str1 sortedstr1 str2 sortedstr2 Compare sorted strings for i in range0, n1: if str1i ! str2i: return False return TrueA ratB tarif areAnagramsA, B: printfA and B are anagramselse: printfA and B are not anagramsOutputrat and tar are anagrams . Response in Sesotho: Anagram ke lentsoe kapa poleloana e entsoeng ka ho hlophisa bocha litlhaku tsa lentsoe kapa poleloana e fapaneng, hangata ho sebelisoa litlhaku tsohle tsa pele hantle hang. Mona ke lenaneo la python ho hlahloba hore na likhoele tse peli ke li-anagrams tsa e mong: python def areAnagramsstr1, str2: Fumana bolelele ba likhoele ka bobeli n1 lenstr1 n2 lenstr2 Haeba bolelele ba likhoele ka bobeli ha li tšoane, khutlisa bohata haeba n1 ! n2: khutlisa Bohata Hlopha likhoele tse peli str1 hlophisoastr1 str2 hlophiloestr2 Bapisa likhoele tse hlophiloeng bakeng sa i ka mefuta 0, n1: haeba str1 i ! str2i: khutlisetsa False return True A rat B tar haeba areAnagramsA, B: printfA le B ke anagrams tse ling: print fA le B ha se anagrams Sephetho rat le tar ke anagrams 