Q.3) For the following problem: max 3x1 + 2x2 + x3 s.t. x2 + 2x3 0 if you know that the following is the optimal tableau z X1 X2 X3 S1 S2 S3 RHS 1 0 0 0 0 o 3 0 2 2 -4 9 6 1 0 o 0 1 0 -1 1 1 0 1 1 1 0 3 And the following is the LINDO report solution of the given problem OBJECTIVE FUNCTION VALUE 1) 9.000000 VARIABLE X1 X2 X3 VALUE A 0.000000 0.000000 REDUCED COST 0.000000 B 2.000000 ROW 2) 3) 4) SLACK OR SURPLUS 6.000000 C 0.000000 DUAL PRICES 0.000000 0.000000 D NO. ITERATIONS= RANGES IN WHICH THE BASIS IS UNCHANGED: VARIABLE X1 X2 X3 CURRENT COEF 3.000000 2.000000 1.000000 OBJ COEFFICIENT RANGES ALLOWABLE ALLOWABLE INCREASE DECREASE INFINITY 1.000000 E F 2.000000 INFINITY ROW 2 3 4 CURRENT RHS 6.000000 4.000000 3.000000 RIGHTHAND SIDE RANGES ALLOWABLE INCREASE INFINITY G 1.000000 ALLOWABLE DECREASE 6.000000 H 3.000000 Find out the values of A, B, C, D, E, F, G, and H (show all your work)