Problem 3: Consider the following linear programming problem: Min 6X 51" + 24Z s.t. 4X + 31" + 92 S 509 2X + 51" 172 = 221 10X + 111' + 32Z 2 261 X S 0 Y unrestricted Z 2 0 Recall that the standard form of a linear programming problem entails maximizing a linear function of the decision variables, subject to less than or equal to constraints, with non-negative decision variables. a) Convert this problem to standard form b) Solve the problem using the Solver. You can use either the standard form or the form above. Using the original decision variables, What is the value of the objective function What are the values of the decision variables Which constraints are binding? Which constraints are not binding? 51.0 gm