Algorithms HELPPPP!!

The Answers area already given in bold, I just don't know how.

Please show all steps

FINDMAXCROSSINGSUBARRAY (A, low, mid, high) 1 left Sum Sum O 3 for i mid downto low Sum suma A ij if sum left:suma left Sum Sum maxLeft i 8 right Sum 9 Sum 10 for j mid-1 to high sum sum A [j] if sum rightsum 12 right sum Sum 13 max Right j +rightsum) leftsuma 15 return FINDMAXIMUMSUBARRAY (A, low, high) 1 if high ,Allow] 2 return (low, high 3 else high) /2) NDMAXIMUMSUBARRAY (A, low r mid) 4 mid floor (low -FI Y (A, mid-1 ,high) 5 (leftLow, leftHigh, left Sum) (A,low ,mid, high) 6 7 (crossLow, cross sum) 8 if (leftsum 2 rightsum) && (leftsum return (leftLow, leftHigh, left Sum) 2 cross 10 elseif (rights um leftsum) && (rightsum Sum) return (rightLow,rightHigh, rightsum) 12 else return (crossLow, crossHigh, crosssum) Figure 1 Pseudocode for Maximum Subarray Problem Algorithm (ref. CLRS 71-72)