<prompt> Etsa algorithm ho khutlisetsa morao likarolo tsa sehlopha se fanoeng.2, 4, 6, 8  <response>: Instruction in English: Design an algorithm to reverse the elements of a given array. . Response in English: One way to design an algorithm to reverse the elements of a given array is as follows:1. Initialize two pointers, one at the start of the array and one at the end of the array.2. While the start pointer is less than the end pointer: a. Swap the values at the start pointer and end pointer. b. Increment the start pointer and decrement the end pointer.3. Continue until all elements have been swapped and the array is reversed.Here is an example implementation in code:def reverse_arrayarr: start 0 end lenarr - 1 while start end: arrstart, arrend arrend, arrstart start 1 end - 1 return arrInput:arr 2, 4, 6, 8Output:printreverse_arrayarr8, 6, 4, 2 . Response in Sesotho: Tsela e ngoe ea ho qapa algorithm ho fetola likarolo tsa sehlopha se fanoeng ke se latelang: 1. Qala litsupa tse peli, e ngoe qalong ea lethathamo le e ngoe qetellong ea lethathamo. 2. Le hoja ntlha ea ho qala e le ka tlaase ho ntlha ea ho qetela: a. Fetola boleng ho pointer ea ho qala le pointer ea ho qetela. b. Eketsa sesupa sa ho qala me u fokotse ntlha ea ho qetela. 3. Tsoela pele ho fihlela likarolo tsohle li fetotsoe me sehlopha se khutlisetsoa morao. Mona ke mohlala oa tsebetsong khoutu: def reverse_arrayarr: qala 0 end lenarr - 1 ha qala 