please include all the steps in detail and write it in a paper if possible(code not needed)

Consider a sequeme of 14 elements [5,10, 6,3,1,2,13,4,9,1,4,12,3,0] the probien of maximum subarray sum is finaing she parte of an array whose elment Solve it theoriticaly with steps [not \& as coge]