Q3. An LPP problem is modelled using the following objective function: Max. z = x1 + x2. The objective function is subjected to three constraints of > types and the decision variables are non-negative. The following is the simplex tableau in i-th iteration of Phase - I of Two Phase simplex method. Basic r R X2 R3 X1 7/2 7/2 14 -5 X2 0 0 1 0 S - 1 -1 0 0 S2 0 0 0 1 Sz 14 14 -1/8 -1 R 0 1 0 0 R2 - 1 0 0 -1 R3 -5/4 -1/4 1/8 1 Solution 6 6 3 0 Here, r is the objective function of Phase-I, S1, S2, and Szare the slack variables for constraint- 1, constraint-2, and constraint-3, respectively. R1, R2, and Rz are the artificial variables for constraint-1, constraint-2, and constraint-3, respectively. Find the optimal solution using the steps of Two Phase simplex method. Perform your calculations in fraction. (10) Q3. An LPP problem is modelled using the following objective function: Max. z = x1 + x2. The objective function is subjected to three constraints of > types and the decision variables are non-negative. The following is the simplex tableau in i-th iteration of Phase - I of Two Phase simplex method. Basic r R X2 R3 X1 7/2 7/2 14 -5 X2 0 0 1 0 S - 1 -1 0 0 S2 0 0 0 1 Sz 14 14 -1/8 -1 R 0 1 0 0 R2 - 1 0 0 -1 R3 -5/4 -1/4 1/8 1 Solution 6 6 3 0 Here, r is the objective function of Phase-I, S1, S2, and Szare the slack variables for constraint- 1, constraint-2, and constraint-3, respectively. R1, R2, and Rz are the artificial variables for constraint-1, constraint-2, and constraint-3, respectively. Find the optimal solution using the steps of Two Phase simplex method. Perform your calculations in fraction