(Solved): Hello! I'm having trouble with this practice problem. Any help is greatly appreciated.  Questio ...

Hello! I'm having trouble with this practice problem. Any help is greatly appreciated. 

Question 1

 

Question 2

Solve the following linear programming problem with the graphic method. • Label each of the constraints and shade the feasible region. Draw at least one line for the objective function. Indicate the optimal solution on the graph. Find the values of x? and x?, as well as the value of the objective function z, at the optimal solution. Then answer the following multiple choice questions. 7x1 + 5x? X2 10 9 8 7 6 5 4 3 2 1 • max S.t. 1 3x? + 8x? = 24 5x + 4x? < 20 9x + 2x? ? 18 X1, X? 20 2 3 4 5 6 7 8 9 10 11 X1 The optimal objective function value is 0 26 6 5 1241 22 26- 57 5 11 3 ] 261 This linear programming model has a unique, i.e., only one, optimal solution alternative optimal solutions O an unbounded objective function O no feasible solution O none of the above