Implement a program that computes the maximum sum of any contiguous subarray of length exactly window_size. You are given an array input of length N consisting of 32-bit signed integers, and an integer window_size.
solve function signature must remain unchangedoutput variableInput: input = [1, 2, 4, 2, 3], window_size = 2 Output: output = 6
Input: input = [-1, -4, -2, 1], window_size = 3 Output: output = -5
N ≤ 50,000input[i] ≤ 10window_size ≤ NN = 50,000