Q3. The final optimal tableau of a maximization linear programming problem with three constraints of type (S) and two unknowns (x1, x2) is given below. Slack variables are denoted by S1, S2, and s; for the respective constraints. Find the value of objective function z in two different ways by using the primal-dual relationships (Hint: The Strong Duality Theorem) (35p) Basis X1 X2 Si S2 S3 RHS Z 0 0 0 | 2 ? Si 0 0 1 1 -1 2 X2 0 1 0 1 0 6 X1 1 0 0 -1 . 1 2