Problem 2: You are given the following linear programming model (see below) in algebraic form, where x1 and x2 are the decision variables and Z is the value of the overall measure of performance. The goal is to maximize the objective function Z = 3X1 + 2X2 subject to: Constraint on resource 1: 3x1 + x2 9 Constraint on resource 2: x1 + 2x2 8 And x1 and x2 are not negative, i.e., x1 > 0 and x2 > 0. (a) Identify the objective function (Z = ??), the functional constraints, and the nonnegativity constraints in this model (see Hillier text pages 33-34 for a review). (b) Incorporate this model into a spreadsheet using the picture below as a guide for the Excel spreadsheet you develop: (the unit profit cells have been filled in for you to give you a start). Hint: There are SUMPRODUCT functions in the two Resource Used cells, and another SUMPRODUCT function in the Total Profit cell. Hint: to answer questions parts c, d, and e, substitute each X1 and X2 values in parts c, d, and e below into the constraints on resources 1 and 2 given above. (c ) Is (X1, X2) = (2,1) a feasible solution? (d) Is (X1, X2) = (2,3) a feasible solution? (e) Is (X1,X2) = (0, 5) a feasible solution? (f) Use Solver to solve this model (to get the yellow decision cells and the orange total profit cell) by creating your Excel linear programming model with the information above and running Excels Solver (Data tab > Solve