Consider the following linear programming problem Maximize $1X1 + $3 X2 Subject to X1 X2 s 4 X1 - X2s1 X1, X20 Constraint A Constraint B Constraint 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 - S1 - S2 Z-X1 - 3 X2 - 0 S1-02-X1 - 3X2 = 0 S20 X1 + X2 54 X1 X2 S1 + S2x1 - X2 51 X1, X2 20 X1 - X2 + 0 S1 + S2 = Z-X1 - 3 X2 - 0 X1 + X2 + S1 = 4 X1 - X2 + S2 = 1 X1, X2, S1, S2 20 X1 + X2=4 X1, X2, S1, S2 20 X1, X2, S1, S2 20 2- Fill out the following blanks with Final Simplex Tableau information Basic Variables X1 X2 S1 S2 2 Right Hand Side 3. The optimalis 2 When X1