QUESTION $11$ points Saved The line representing the equation part of the constraint $7$x$1+4$x$2$ s $28$ goes through the following two points $(4,0)$ and $(7,0)(0,4)$ and $(7,0)(4,0)$ and $(0,7)(0,4)$ and $(0,7)$ none of the above QUESTION $21$ points Saved The line representing the constraint $4$x $1+5$x$2=20$ goes through the following two points $(4,0)$ and $(5,0)(5,0)$ and $(4,0)(4,0)$ and $(0,5)(0,4)$ and $(0,5)$ none of the above QUESTION $31$ points Save Answer The point $(1,35$ O 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. O none of the above. QUESTION $41$ points Save Answer The point $(4,0)$ is O feasible. infeasible. an extreme point of the feasible region. optimal. Onone of the above. QUESTION $51$ points Save Answer 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. O satisfies the second and third constraints but not the first. O none of the above. QUESTION $61$ points Save Answer Assigning a value of $10$ to the objective function, i$.$e$.,$ making $5$x$1+2$x$2=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)$ O none of the above QUESTION $71$ points Saved The point$(0,4)$ is feasible. O an extreme point in the feasible region. O not optimal. O all of the above. none of the above. QUESTION $81$ points Save Answer The optimal solution of this linear programming model is $(3,2)(4,0)(0,4)(8/5.21/5)(60/19.28/19)$ QUESTION $91$ points Save Answer The optimal objective function value is $00001824$ QUESTION $101$ points Saved This linear programming model has a unique, i$.$e$.,$ only one, optimal solution. alternative optimal solutions. an unbounded objective function. O no feasible solution. O none of the above.