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 methods. Label the line for 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, at the optimal solution. Max 5x + 2x2 sit 7x2 + 4x2 S 28 1X2 + 2x2 5 10 4x + 5x2 = 20 X1, X220 X2 10 9 8 7 6 LD 5 1 4 3 3 2 1 1 2 3 4 5 6 7 8 00 9 10 X1 QUESTION 1 The line representing the equation part of the constraint 7 X1 +4x2 s 28 goes through the following two points O (4.0) and (7.0) O (0.4) and (7.0) O (4.0) and (0.7) O (0,4) and (0.7) O none of the above QUESTION 2 The line representing the constraint 4x1 +5x2 = 20 goes through the following two points O(4.0) and (5,0) O (5,0) and (4,0) O (4,0) and (0,5) O (0,4) and (0,5) none of the above QUESTION 3 QUESTION 3 The point (1,35 is feasible. satisfies the first constraint but not the second and third. satisfies the second constraint but not the first and third. satisfies the third constraint but not the first and second. none of the above. QUESTION 4 The point (4,0) is O feasible. infeasible. an extreme point of the feasible region. optimal none of the above. QUESTION 5 The point (0,4) O is feasible. 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. 1 p QUESTION 6 Assigning a value of 10 to the objective function, i.e. making 5X1 + 2x2 = 10, the line representing the objective function goes through the following two points O (2.0) and (5,0) (0.2) and (5,0) 0 (0.2) and (0,5) O (2.0) and (0,5) O none of the above 1 points Save Answer QUESTION 7 The point (0,4) is feasible. O an extreme point in the feasible region. O not optimal. O all of the above. O none of the above. QUESTION 8 The optimal solution of this linear programming model is O (3,2) O (4,0) O (0.4) O (8/5. 21/5) O (60/19. 28/19) QUESTION 9 The optimal objective function value is 0 19 20 8 N 162 O 14 18 19 QUESTION 10 This linear programming model has O a unique, i.e., only one, optimal solution. O alternative optimal solutions. an unbounded objective function. O no feasible solution. none of the above