In each LP problem below solve using the "intersection points" method. This means you will: (a) Rewrite the system of n variables by introducing m slack variables. Display the revised system. (b) Determine the number of ways you can set n of the n+m variables to zero. (Use nCr on your calculator). (c) Create a table for all the variables with the correct number of rows with every possible way you can choose n zeros filled in. (Using Excel makes this pretty easy. You can copy-and-paste a table into the answer area below). (d) Go through each row in the table, set to zero in your revised system all zeros indicated in your table row, then solve for the remaining variables in the system. Fill in those values in the table row. (e) Display your table below. (f) Identify the rows with all non-negative values. (g) List all corner points of the feasible region, then evaluate the objective function at each of these. (h) State the solution of the problem: What is the optimal solution, and at what point(s) does it occur? Question 1 Solve the following LP problem. See the instructions above. Maximize z = 10x + 12y Subject to: x + 2y s 12 3x + 2y < 24 and x, y 2 0 HTML Editorm B / U A - A - I E E X, E E , I T. 12pt Paragraph a. b.