(b) (1) Find the optimal solution for the following Linear Programming problem, using Simplex method. Maximize 2x, + x2 + x (1) subject to x + 5x2 + xy S5 3x, + 2 x2 + x3 s 9 5.x, +4x2 + 2x, s 10 X, X, X, 20 (26 marks) (ii) Which of the constraints (1) - (3) are binging, and which of them are non- binding? (3 marks) (iii) Write down the shadow prices of constraints (1) - (3). (3 marks) (iv) Write down the reduced costs for x,, x, and xz