Consider the following linear programming problem Maximize $1 X1 + $3 X2 Subject to X1 + X2 4 Constraint A X1 - X2 s 1 Constraint B Constraint C X1, X2 20 Note: Report two digits after the decimal point. Do NOT use thousands-separators () 1 - Which of the following is the correct standard maximization form for the above linear programming problem Z-X1 - 3X2 = 0 Z-X1 - 3x2 - S1 - 520 Z - X1 - 3 X2=0 X1 + X2 + S1 = 4 X1 + X24 Z - X1 - 3 X2 - 0 S1 - 0 S20 X1 + X2 + S1 + 0 S2 = 4 X1 - X2 + 0 S1 + S2 = 1 X1, X2, S1, S2 20 X1 + X2 s 4 X1 - X2 51 X1 - X2 + S2 - 1 |X1 X2=1 X1, X2, S1, S2 20 X1, X2 20 X1, X2, S1, S2 0 2- Fill out the following blanks with Final Simplex Tableau information Basic Variables X1 X2 S1 S2 z Right Hand Side . 4 3- The optimal is Z- When X1 = X2 =