(4) Consider the following simplex tableaus used to solve a linear programming problem: Initial simplex tableau: Basis Eq. 2 2 (0) 1 S1 (1) 0 S2 (2) 0 S3 (3) 0 1 -2 3 1 0 12 si S2 S3 RHS -1 0 0 0 0 4 1 0 0 24 0 0 1 0 6 1 0 0 1 4 Ratio - 8 6 Undefined Final simplex tableau: Basis Eq. 2 r 2 (0) 1 0 12 (1) 0 0 0 (2) 0 1 S3 (3) 0 0 12 0 1 0 0 S1 0.25 0.25 0 -0.25 S2 S3 RHS Ratio 1.250 13.5 -0.75 0 1.5 1 0 6 0.75 1 2.5 (a) What is the objective function of the original linear programming problem (i.e. prior to its conversion to standard form)? (1 mark) (b) Which of the three constraints (first, second and/or third) will be binding at the optimal solution? (1 mark) (c) What variables will be basic in the second simplex tableau (i.e. the simplex tableau that is produced immediately after performing one simplex iteration on the initial tableau)