<prompt> Rala algorithm ho bala palo e kholo ea kakaretso ea boholo ba k ka lethathamo la boholo ba na -2, 1, -3, 4, -1, 2, 1, -5, 4, k 3  <response>: Instruction in English: Design an algorithm to calculate the maximum sum subarray of size k in an array of size n . Response in English: 1. Start by defining your input a which is the list and k which is the size of the subarray you want to find.2. Define your initial values for max_sum, which is the maximum sum of the subarray and should be initially set to negative infinity -inf, and window_sum, which will be used to keep track of the sum of the current window subarray and should be set to sum of the first k elements of the list a.3. Iterate over the list a starting from the index k to the end using a for loop. For each iteration, you will update the window_sum by subtracting the first element of the window and adding the next element after the window.4. Update the max_sum value with the maximum value between max_sum and window_sum.5. After the iteration is complete, return the max_sum value which will represent the maximum sum of a subarray of size k.pythondef max_suma, k: max_sum float-inf window_sum suma:k for i in rangek, lena: window_sum window_sum - ai - k ai max_sum maxmax_sum, window_sum return max_suma -2, 1, -3, 4, -1, 2, 1, -5, 4k 3result max_suma, kprintfMaximum sum of subarray of size k: result . Response in Sesotho: 1. Qala ka ho hlalosa tlhahiso ea hau a e leng lethathamo le k e leng boholo ba sehlopha sa sehlopha seo u batlang ho se fumana. fensetere subray me e lokela ho hlophisoa hore e be kakaretso ea likarolo tsa pele tsa k tsa lenane a. 3. Pheta holima lenane a ho qala ho index k ho isa qetellong u sebelisa a for lupu. Poeletsong e nngwe le e nngwe, o tla ntjhafatsa window_sum ka ho ntsha karolo ya pele ya fensetere ebe o kenya ntho e latelang ka mora fensetere. 4. Ntlafatsa boleng ba max_sum ka boholo ba boleng bo pakeng tsa max_sum le window_sum. 5. Kamora hore phetisetso e phethe, khutlisetsa boleng ba max_sum e tla emela kakaretso ea kakaretso ea sehlopha sa boholo ba k. python def max_suma, k: max_sum float-inf window_sum kakaretsoa:k bakeng sa i ka lethathamok, lena: window_sum window_sum - a i - k ai max_sum maxmax_sum, window_sum return max_sum a -2, 1, -3, 4, -1, 2, 1, -5, 4 k 3 sephetho max_sum a, k hatisafPalo e ka holimo ho sehlopha sa boholo ba sehlopha k: sephetho 