<prompt> Hlahisa algorithm ho fumana khoele e telele ka ho fetisisa ea likhoele tse pelinan  <response>: Instruction in English: Generate an algorithm to find the longest substring of two strings . Response in English: Here is an algorithm to find the longest common substring of two strings:1. Define two input strings, str1 and str2.2. Initialize a variable max_length to 0 and a variable result to an empty string. These will hold the maximum length of the common substring and the common substring itself.3. Initialize a 2D array dp with dimensions lenstr1 1 lenstr2 1. This will hold the lengths of common substrings ending at each character in str1 and str2.4. Loop through each character in str1 using a variable i, and loop through each character in str2 using a variable j.5. If str1i - 1 is equal to str2j - 1, then set dpij to dpi - 1j - 1 1. This means that the common substring ending at i and j is extended by one character.6. If dpij is greater than max_length, update max_length to dpij and update the result variable to str1i - max_length:i. This means that the longest common substring has been found so far.7. Continue looping until all characters have been processed.8. Return the result variable as the longest common substring. . Response in Sesotho: Mona ke algorithm ea ho fumana likhoele tse telele ka ho fetisisa tse tloaelehileng tsa likhoele tse peli: 1. Hlalosa likhoele tse peli, str1 le str2. 2. Qala ho feto-fetoha max_length ho ea ho 0 le phetoho sephetho ho khoele e se nang letho. Tsena li tla tšoara bolelele bo boholo ba khoele e nyenyane e tloaelehileng le substring e tloaelehileng ka boeona. 3. Qala sehlopha sa 2D dp se nang le litekanyo lenstr1 1 lenstr2 1. Sena se tla tšoara bolelele ba likhoele tse nyenyane tse qetellang tlhakung ka ngoe ho str1 le str2. 4. Lula ka hara tlhaku e ngoe le e ngoe ho str1 u sebelisa e feto-fetohang i, me u kenye tlhaku ka ngoe ho str2 u sebelisa j. 5. Haeba str1i - 1 e lekana le str2j - 1, joale beha dpij ho dpi - 1j - 1 1 . Sena se bolela hore thapo e nyenyane e qetellang ka i le j e atolosoa ka tlhaku e le ngoe. 6. Haeba dpij e le kholo ho feta max_length, nchafatsa max_length ho dpij me u nchafatse phetoho ea sephetho ho str1i - max_length:i . Sena se bolela hore substring e telele ka ho fetisisa e tloaelehileng e fumanoe ho fihlela joale. 7. Tsoela pele ka looping ho fihlela litlhaku tsohle li se li sebelitsoe. 8. Khutlisetsa phetoho ea sephetho joalo ka khoele e nyenyane e telele ka ho fetisisa e tloaelehileng. 