Question 3: (25 points) Consider the maximization problem represented by an iteration of simplex tableau given below. Let si, $2,5denote the stack variables for the three constraints. BVs Z 1 0 X1 0 1 52 0 $ 5 0 X2 0 -2 0 -5 RHS 9 Xy -2 3 -2 S3 0 0 Row 0 Row 1 Row 2 Row 3 18 XI 0 0 0 1 0 0 0 52 - 1 7 2 14 0 1 S3 Cross the appropriate box without computing further iterations. (a) (7 points) Is the current iteration optimal? YES Can't tell at this iteration NO Justify your answer: (b) (6 points) is the problem feasible? YES NO Can't tell at this iteration Justify your answer: (c) (6 points) Is the problem objective unbounded? YES NO Can't tell at this iteration Justify your answer: (d) (6 points) Does this problem have more than one optimal solution? YES NO Can't tell at this iteration Justify your