3. Consider the following linear programming problem: max 21 + 2.02 +03 s.t. 21 +33 > -10 22 +2.13 = 5 21,12,13 > 0 (a) (4 points) Write the linear program in standard form for the simplex algorithm: (b) (4 points) Provide the initial tableau: (c) (2 points) What is the basic solution corresponding to this initial tableau? (d) (2 points) Is this an optimal tableau? circle the correct answer and provide the leaving and entering variables if the answer is no. YES NO Leaving: Entering: (e) (4 points) Do one iteration of the simplex method, and provide the new tableau: (g) (3 points) Does this tableau represent a feasible solution to the original problem? Circle the correct answer and explain why. Circle the correct answer and provide an explanation: YES NO Explain: (h) (2 points) Do we need to continue the simplex iteration? Circle the correct answer and explain why. Circle the correct answer and provide an explanation: YES NO Explain