<prompt> Theha algorithm ho fumana tlhaku ea pele e pheta-phetoang khoeleng.nan  <response>: Instruction in English: Create an algorithm to find the first repeating character in a string. . Response in English: Here is a simple algorithm to find the first repeating character in a string:1. Start by creating an empty dictionary or hash table to keep track of the frequency of characters in the string.2. Iterate through each character of the string, one by one, using a loop.3. For each character, check if it is already present in the dictionary. a. If the character is not present, add it to the dictionary and set its frequency to 1. b. If the character is already present in the dictionary, it means that it is a repeating character. Return this character and exit the loop.4. If no repeating characters are found after the loop finishes, return None.Here is a Python implementation of the above algorithm:pythondef first_repeating_charstring: frequency for char in string: if char in frequency: return char else: frequencychar 1 return None . Response in Sesotho: Mona ke algorithm e bonolo ea ho fumana tlhaku ea pele e pheta-phetoang khoeleng: 1. Qala ka ho theha bukana e se nang letho kapa tafole ea hash ho boloka tlaleho ea khafetsa ea litlhaku khoeleng. 2. Pheta tlhaku ka ngoe ea khoele, ka bonngoe, u sebelisa lupu. 3. Bakeng sa tlhaku ka ngoe, hlahloba hore na e se e le teng bukeng ea bukantswe. a. Haeba tlhaku e le sieo, e kenye bukeng ea ho hlalosa mantsoe me u behe makhetlo a eona ho 1. b. Fa moanelwa a setse a le teng mo thanoding, go raya gore ke moanelwa yo o ipoeletsang. Khutlisetsa sebapali sena me u tsoe ka loop. 4. Haeba ho se na litlhaku tse pheta-phetoang ka mora hore lupu e phethe, khutlisetsa Ha ho letho. Mona ke tsebetsong ea Python ea algorithm e ka holimo: python def first_repeating_charstring: frequency for char in string: if char in frequency: return char else: frequencychar 1 return None 