s.t Solve the following linear programming problem with the graphical method. Answer the question that follows. Max 5x1 + 2x2 7x1 + 4x23 28 1x1 + 2X2 10 4X1 +5x2 = 20 X1, X220 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. satisfies the first constraint only. Solve the following linear programming problem with the graphical method. Answer the question that follows. Max 5X1 + 2x2 st 7X1 +4x25 28 1x1 + 2x25 10 4X1 +5x2 = 20 X1, X220 The line representing the equation part of the constraint 7x1+4x2 s 28 goes through the following two points O (4,0) and (7,0) O 0.4) and (7,0) (4,0) and (0,7) O (0,4) and (0,7) O none of the answers is correct. Solve the following linear programming problem with the graphical method. Answer the question that follows. Max 5X1 + 2x2 sit 7X1 +4x25 28 1x1 + 2x25 10 4X1 + 5x2 = 20 X1, X220 The optimal objective function value is 19.00 20.00 8.00 O 16.40 18.74 Solve the following linear programming problem with the graphical method. Answer the question that follows. Max 5x1 + 2x2 s.t 7X1 + 4x2s 28 1x1 + 2x25 10 4X1 +5x2 = 20 X1, X2 20 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) O (0, 2) and (5,0) O (0, 2) and (0,5) O (2.0) and (0,5) O none of the answers is correct