<prompt> Hlahisa algorithm e fumanang le ho bontsa khoele e telele ka ho fetesisa e tloaelehileng lipakeng tsa likhoele tse peli tsa mongolo.Mohala oa 1: Ona ke mohlala Khoele ea 2: Khoele ena e lokela ho ba le mohlala  <response>: Instruction in English: Generate an algorithm that finds and displays the longest common substring between two strings of text. . Response in English: The following algorithm can be utilized to find the longest common substring between two given strings of text:1. Start by initializing variables to store the lengths of the two strings, lets call them m and n. m length of String 1 n length of String 22. Create a 2D array of size m1 x n1 to store the lengths of the longest common suffixes of substrings between the two strings. Initialize all the elements in the array to 0.3. Initialize a variable, lets call it result to store the length of the longest common substring. Set its initial value to 0.4. Run a nested loop to iterate over the characters in both strings, starting from the last character.5. For each pair of characters, compare them. If they are the same, update the 2D array with the length of the current common suffix by adding 1 to the length of the previous common suffix from the diagonal cell. Keep updating the result variable by storing the maximum length of the common suffix found so far.6. After the loops have ended, the result variable will contain the length of the longest common substring.7. To find the actual substring, start from the index in String 1 where the maximum length was found and move backwards by the length of the maximum common substring.8. Display the longest common substring.Applying this algorithm to the given input strings, we get the following result:Longest Common Substring: example The length of the Longest Common Substring is 7 and the substring is example. . Response in Sesotho: Algorithm e latelang e ka sebelisoa ho fumana khoele e telele ka ho fetisisa e tloaelehileng lipakeng tsa likhoele tse peli tse fanoeng: 1. Qala ka ho qala mefuta e fapaneng ho boloka bolelele ba likhoele tse peli, ha re li bitse m le n. m bolelele ba Khoele ea 1 n bolelele ba Khoele ea 2 2. Etsa lethathamo la boholo ba 2D m1 x n1 ho boloka bolelele ba li-suffixes tse telele ka ho fetisisa tse tloaelehileng tsa likhoele tse nyenyane pakeng tsa likhoele tse peli. Simolola dielemente tsohle tse lenaneng ho ya ho 0. 3. Qala ho feto-fetoha, ha re e bitse sephetho ho boloka bolelele ba thapo e nyane e tlwaelehileng. Beha boleng ba eona ba pele ho 0. 4. Matha sehlaha sa sehlaha ho pheta-pheta holima litlhaku tse likhoeleng ka bobeli, ho qala ho tloha ho tlhaku ea ho qetela. 5. Bakeng sa para ka ngoe ea litlhaku, li bapise. Haeba li tšoana, nchafatsa sehlopha sa 2D ka bolelele ba sehlongoana sa hona joale se tloaelehileng ka ho eketsa 1 ho bolelele ba sehlongoa sa pele se tloaelehileng ho tloha ho sele e tjaro. Tsoela pele ho nchafatsa sephetho e feto-fetohang ka ho boloka bolelele ba sehlomathi se tloaelehileng se fumanoeng ho fihlela joale. 6. Ka mora hore loops e fele, sephetho e feto-fetohang e tla ba le bolelele ba mohala o monyenyane o tloaelehileng ka ho fetisisa. 7. Ho fumana khoele e nyenyane ea sebele, qala ho index ho Mohala oa 1 moo bolelele bo ka holimo bo ileng ba fumanoa me u khutlele morao ka bolelele ba boholo ba khoele e nyenyane e tloaelehileng. 8. Hlahisa khoele e nyenyane e telele ka ho fetisisa e tloaelehileng. Ha re sebelisa algorithm ena ho likhoele tse kentsoeng, re fumana sephetho se latelang: Moelelo o Tloaelehileng o Molelele ka ho Fetisisa: mohlala Bolelele ba Mohala o Motelele ka ho Fetisisa o Tloaelehileng ke 7 me substring ke mohlala. 