The table below shows an iteration of the simplex method in a maximization linear programmi prothem. Continue iterating by calculating ONLY the new pivot tow. Basic X1 X2 X3 51 52 53 PHS 3 -2 1 0 0 s1 1 1 2 1 0 0 10 S2 2 -1 1 0 1 0 20 53 3 1 0 0 0 1 15 The coefficients of the new pivot row are: *Formulas New pivot row = Current pivot row - Pivot element New row = (Current row) - (pivot column coefficient) X (New pivot row) Select one: O a. None of the options provided O b. 1, 1/3, 0, 0, 0, 1/3, 5 O c. 1, -1/2, 1/2, 0, 112, 0, 10 52 41 0 0 20 WIN s3 1 0 0 1 15 The coefficients of the new pivot row are: *Formulas New pivot row = Current pivot row - Pivot element New row = (Current row) - (pivot column coefficient) X (New pivot row) Select one: 0 a. None of the options provided O b. 1, 1/3, 0, 0, 0, 1/3,5 O c. 1,-1/2, 1/2,0, 1/2,0, 10 O d. 1, 1, 2, 1, 0, 0, 10 O e. 1/2, 1/2, 1, 1/2, 0, 0,5 O f. 1,-/2, -1/2, 0, 1/2, 0, -10 O g. 1/2, 1/2, 1.-5/2, 0, 0, -5