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 QUESTION 7 The point (0,4) is feasible. an extreme point in the feasible region. not optimal. all of the above. none of the above. QUESTION 8 The optimal solution of this linear programming model is (3,2)(4,0)(0,4)(8/5,21/5)(60/19,28/19) QUESTION 9 The optimal objective function value is 192081652181914 This linear programming model has a unique, i.e., only one, optimal solution. alternative optimal solutions. an unbounded objective function. no feasible solution. none of the above