1. Below is a simplex table of a maximization type linear programming problem. Perform the necessary calculations on this provided simplex table and then answer the following questions. a) Determine the values of decision variables and slack variables according to this simplex table. Provide information about the limited resource usage by making necessary explanations for slack variables. b) Calculate the value of the objective function according to this simplex table. c) Is the optimum solution obtained in this simplex table? Explain how you made the decision. d) If this simplex table does not represent the optimum solution point; In the next simplex table, specify the variable that should be erased from the basic variables and the variable that should be added to the basic variables instead. 2. Find the optimum solution point(s) of the linear programming (LP) model given below using a graphical method. Find the values of decision variables and the objective function. (You must draw the graph yourself. You must show the constraints, the feasible region, the objective function, and the optimum solution point(s) on the graph.) (It is recommended to use colored pencils so that your drawings are clear.) Zmin=3x1+5x23x1+2x2363x1+5x245x1,x20