5. Maximum sum in sliding window: Given array All with sliding window of size w which is m left of the array to the very right. Assume that we can only see the w numbers in the window sliding window moves rightwards by one position. For example: the array is [13-1 -3536 and w is 3. Each time the 71 (10 pts) Input: A long array All, and a window width w. Output: An array B[L, Bl] is the maximum value of form Ali] to Aliew 1. ease complete the table below and mention which data structure can solve such problem? (1s row has been completed for you) Window Position Max -3