<prompt> Fumana likarolo tse peli tse sa iphetetseng ka letoto la likarolo tse pheta-phetoang?arr 2, 3, 7, 9, 11, 2, 3, 11  <response>: Instruction in English: Find the two non-repeating elements in an array of repeating elements? . Response in English: You can use hash maps to find the two non-repeating elements in an array of repeating elements. Heres an example code written in Python to achieve that:arr 2, 3, 7, 9, 11, 2, 3, 11 creating an empty hash tablehashTable iterating through the arrayfor i in arr: checking if the element is present in the hash table or not if i in hashTable: if present increment its value by 1 hashTablei hashTablei 1 else: if not present, then add the element in the hash table with the value of 1 hashTablei 1 creating an empty list that will store the resultresult iterating through the hash tablefor i in hashTable: checking if the value of the element is 1 or not if hashTablei 1: if yes, then add it to the result result.appendiprintfThe two non-repeating elements are: resultOutput: The two non-repeating elements are: 7, 9 . Response in Sesotho: ka sebelisa limmapa tsa hash ho fumana likarolo tse peli tse sa iphetang ka letoto la likarolo tse pheta-phetoang. Mona ke mohlala oa khoutu e ngotsoeng ho Python ho fihlela seo: arr 2, 3, 7, 9, 11, 2, 3, 11 ho theha tafole e se nang letho hashTable iterating ka hara sehlopha sa i in arr: ho hlahloba hore na ntho e teng tafoleng ea hash kapa che haeba ke le ka hara hashTable: haeba e teng e eketsa boleng ba eona ka 1 hashTablei hashTablei 1 e ngoe: haeba e le sieo, joale eketsa ntlha ho tafole ea hash e nang le boleng ba 1 hashTablei 1 ho theha lethathamo le se nang letho le tla boloka sephetho ho pheta-pheta ka hara tafole ea hash bakeng sa i ho hashTable: ho hlahloba hore na boleng ba ntho ke 1 kapa che. haeba hashTablei 1: haeba ho joalo, joale e kenye sephethong.appendi printfLikarolo tse peli tse sa iphetang ke: sephetho Output: The two lintlha tse sa pheteng ke: 7, 9 