(a) (10 marks) Perform two interations of the simplex method toward solving the problem. (Note that the initial simplex is not counted as an iteration. Please, clearly show your steps.) Below is the final simplex tableau: Basis N X S3 Z Cj-Z CB 8 6 60 0 X 6 0 1 0 6 0 y 4 0.25 0.5 -0.005 5 -1 Z 8 1 0 0 8 0 S1 0 37.5 -25 -0.25 150 -150 $2 0 -25 50 -0.5 100 -100 S3 0 0 0 0 0 (b) (1 mark) What is the optimal solution found by the simplex method? (c) (1 mark) What is the optimal value of the problem? (d) (1 mark) How many constraints are binding? Which of them and why? 100 400 6 3,200