Question 2 (5 + 5 = 10 marks) Consider the following LP: max 2 = 31 02 25 s.t. 21 + 22 18 + x3 + 2x4 + + 3x3 + 2.35 + 5x3 + + 2x3 + 231 25 24 21 24 10 21, 22, 23, 24, 25 > 0. By introducing the slack variable s2 for the second constraint and performing the Simplex method with the initial basis (x2, 82, x4), we can obtain the final/optimal Simplex tableau as follows: basis X2 24 25 S2 rhs 2 3 2 9 2 0 s |~- 0 - N- Nico SCICU 1-10 029 0 9 1 25 3 2 0 1 1 S2 7 2 0 0 1 15 24 1 1 0 2 1 0 0 10 (a) Generate the dual of the considered LP by applying the asymmetric dual transformation rules and setting the dual variables as y1, y2, and yz. (b) Without solving the dual LP, its optimal solution can be obtained by virtue of the primal shadow prices. Generate an optimal solution (y1, y), y) to the dual LP in (a) using its primal LP and final/optimal tableau shown above