Moving to another question will save this response. Question 1 of 4> Question 1 12 points (FORMATTING: Please read carefully! For all questions where you have to enter a number: - Enter the number with digits, not in letters. For example: enter 10, not Ten. - If there is a fraction to the number, do not enter unnecessary zeros. For example: enter 12.5, not 12.50. - If there are more than two digits in the fraction, enter the first two. For instance, if your answer is 1/3, enter 0.33 and if it is 2/3, enter 0.66 . - Do not enter commas. For example: enter 3850, not 3,850. - Do not enter any extra spaces or other characters. EXCEPTIONS, in order to be fair to everyone in the class.) Consider the following linear programming. MinimizeSubjectto2X+3Y2X+Y>=10X+2Y>=8X+Y>=5X>=2Y>=1 Draw the plot for the feasible region. The set of feasible solutions for this linear programming has The objective value for the optimal corner point is The objective value for the second-best corner point is of the new coefficient, NOT the change NOR the value of objective.) corner points. (Enter the number of corner points)