solve it but not as a code please include all the steps

Consider a sequeme of 14 elements {5,10, 6,3,1,2,13,4,9,1,4,12,3,0] The problem of maximum subarray sum is finding the parte of an array whose elment haithe largest sum