<prompt> a -2, 1, -3, 4, -1, 2, 1, -5, 4, k 3Kubuni algorithm ya mahesabu ya jumla ya juu subarray ya ukubwa k katika safu ya ukubwa n  <response>: 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 