Q3. The final optimal tableau of a maximization linear programming problem with three constraints of type ( \( \leq \) ) and two unknowns ( \( \mathrm{x} 1, \mathrm{x} 2 \) ) is given below. Slack variables are denoted by \( \mathrm{s}_{1}, \mathrm{~s}_{2} \), and \( \mathrm{s}_{3} \) 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). ( 35 p )