<prompt> Ha u fuoa palo e felletseng, etsa algorithm ho khutlisetsa ntho e kholo ka ho fetisisa.4, 2, 7, 9, 1  <response>: Instruction in English: Given an array of integers, compose an algorithm to return the largest element. . Response in English: To find the largest element in an array of integers, we can use a simple algorithm that compares all the elements in the array.Here is one example of how this can be done:1. Initialize a variable max_value with the value of the first element in the array.2. Loop through the array, starting from the second element index 1.3. If the current element is greater than max_value, update max_value with the value of the current element.4. Keep looping until all elements have been compared.5. Return max_value as the largest element in the array.Here is the pseudocode for the algorithm:def find_largest_elementarr: max_value arr0 for i in range1, lenarr: if arri max_value: max_value arri return max_valueAnd here is an example of how you can apply this algorithm to the input given:Input: 4, 2, 7, 9, 1 Initialize max_value with the first element in the array max_value 4 Compare max_value with the second element 2 2 is not greater than 4, so max_value remains unchanged Compare max_value with the third element 7 7 is greater than 4, so max_value is updated to 7 Compare max_value with the fourth element 9 9 is greater than 7, so max_value is updated to 9 Compare max_value with the fifth element 1 1 is not greater than 9, so max_value remains unchanged Return max_value as the largest element in the array return 9Output: 9. . Response in Sesotho: Ho fumana ntho e kholo ka ho fetisisa lethathamong la lipalo tse felletseng, re ka sebelisa algorithm e bonolo e bapisang likarolo tsohle tsa sehlopha. Mohlala ke ona o le mong oa hore na sena se ka etsoa joang: 1. Qala ho feto-fetoha max_value ka boleng ba elemente ea pele lethathamong. 2. Lula ka hara sehlopha, ho qala ho tloha karolong ea bobeli index 1. 3. Haeba elemente ea hajoale e le kholo ho feta max_value, ntlafatsa max_value ka boleng ba elemente ea hajoale. 4. Tsoela pele ho lla ho fihlela likarolo tsohle li bapisitsoe. 5. Khutlisetsa max_value joalo ka ntho e kholo ka ho fetisisa lethathamong. Mona ke pseudocode bakeng sa algorithm: def find_largest_elementarr: max_value arr0 for i in range1, lenarr: if arri max_value: max_value arri return max_value Mona ke mohlala oa kamoo o ka sebelisang algorithm ena ho kenyelletso e fanoeng: Kenyelletso: 4, 2, 7, 9, 1 Qala max_value ka karolo ea pele ho array max_value 4 Bapisa max_value e nang le element ea bobeli 2 2 ha e kholo ho feta 4, kahoo max_value e lula e sa fetohe Bapisa max_value le karolo ea boraro 7 7 e kholo ho feta 4, kahoo max_value e ntlafatsoa ho 7 Bapisa max_value le karolo ea bone 9 Sephetho: 9. 