Question 2 a. Given the following linear programming model: MinZ=10X1+2X2 Such that: 8X1+4X2=326X1+8X2484X1+6X224X1,X20 i. Transform this problem into standard simplex form [5] ii. Construct the initial simplex tableau [3] ii. Using the Big M method, perform two iterations of the simplex process on the initial tableau to obtain the next two simplex tableaux [8] v. With reference to the last tableau in (iii): Is the solution optimal? State the current solution, objective function and all other variable values. 5] b. i. What is meant by shadow price in linear programming? [2] ii. What is meant by convex set of points? [2]