Sohve the following lines programming prabiem with the gaphic methads. Label the line for each of the constraints and shade the feasible region. Draw at least one ine for the objecthe furction. Indicate the cotimal salution an the gaph. Find the values of x1 and x3 as well as the value of the objective function, at the optimal solution. Maxs.t5x1+2x27x1+4x2281x1+2x2104x1+5x2=20 The point (4,0) is feasible. infeasible. an extreme point of the feasible region. optimal. none of the above. QUESTION 5 The point (0,4) 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. QUESTION 6 Assigning a value of 10 to the objective function, j.e., making 5x1+2x2=10, the line representing the objective function goes through the following two points (2,0) and (5,0) (0,2) and (5,0) (0,2) and (0,5) (2,0) and (0,5) none of the above