Please explain your work

2 Maximum Subarray Sum The Maximum Subarray Sum problem is the task of finding the contiguous subarray with largest sum in a given array of integers. Each number in the array could be positive, negative, or zero. For example: Given the array [2,1,3,4,1,2,1,5,4] the solution would be [4,1,2,1] with a sum of 6. [25 points] Give a dynamic programming algorithm for this problem with complexity O(n). Implement this in the language of your choice and include your code in this document and submit the source code file