Consider the following LP problem. z = 9.10x1 + 6.002 Manimize Subject to: Constraint 1 Constraint 2 Constraint 3 5x1 + 3x2 2 30, 2x1 + 5x2 2 33, X1,x220, where xy and xz represent the decision variables. Solve the LP problem to answer the following questions. a. What are the values of xy and x2 at the optimal solution? What is the minimum value of 2? (Round your answers to 2 decimal places.) Value of xy at the optimal solution Value of x2 at the optimal solution Maximum value of z b. Identify the binding and nonbinding constraints and report the surplus value, as applicable. (If the answer to constraints is "Non- Binding" enter surplus value or leave cells blank.) Constraint 1 Constraint 2 c. Report the shadow price and range of feasibility of each binding constraint. (If the answer to constraints is "Binding" enter "Shadow price" and "Range of feasibility" to 2 decimal places or leave cells blank.) Shadow Price Range of Feasibility From To Constraint 1 Constraint 2 d. What is the range of optimality for the two objective function coefficients? (Round your answers to 1 decimal place.) Range of Optimality for the Objective Function Coefficients From X1 X2