Hello! please answer all 10 questions clearly please its sometimes hard to understand the experts please thank you!

Use the following scenario and data for questions 1 to 10 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 xz, as well as the value of the objective function 2, at the optimal solution. Then answer the following multiple choice questions. max 7x + 5 x S. 3x; +8 x2 = 24 5x +4x2 20 9x + 2 x 2 18 X1, X3 20 10 I . 7 6 5 3 2 10 11 QUESTION 1 2 The line representing the equation part of the constraint 5x2 + 4x2 s 20 goes through the following two points O (5,0) and (0.4) O (4,0) and (0,5) O (5,0) and (4.0) (0,4) and (0,5) none of the above QUESTION 2 The line representing the equation part of the constraint 9X 1 + 2x2 2 18 goes through the following two points (2.0) and (90) (0.9) and (0, 2) (2.0) and (0.9) (0.2) and (9,0) none of the above QUESTION 3 The point (3, 3) is feasible satisfies the first constraint but not the second and third satisfies the second constraint but not the first and third O satisfies the third constraint but not the first and second none of the above QUESTION 4 The point (16/11, 27/11) is O infeasible O in the interior of the feasible region O an extreme point of the feasible region optimal O none of the above QUESTION 5 The point (3, 1) O is feasible O satisfies the first and second constraints but not the third satisfies the first and third constraints but not the second satisfies the second and third constraints but not the first none of the above QUESTION 6 Assigning a value of 35 to the objective function, le, making7X1 +5x2 = 35, the line representing the objective function goes through the following two points (5.0) and (0.7) O (0,5) and (7.0) O (0,5) and (0.7) O (5.0) and (7.0) O none of the above QUESTION 7 The point (1, 4) is O feasible O an extreme point in the feasible region O optimal O all of the above O none of the above QUESTION 8 The optimal solution of this linear programming model is O (11/16, 11/27) O (27/11, 16/11) O (15/7, 16/7) O (16/11, 27/11) O (16/7, 15/7) QUESTION The optimal objective function value is 269 24 11 O 5 0 26 0 22 1 1 1 5 11 A 1025 MIN QUESTION 10 This linear programming model has O a unique, i.e., only one, optimal solution O alternative optimal solutions O an unbounded objective function O no feasible solution O none of the above