Question 6 1 pts Solve the previous formulated model (Crumb and Custard Bakery problem) by using graphical analysis. Plot lines for each constraint and then identify the feasible solution area. Which of the following points is NOT among the corner points of the feasible solution area? O (5.0) O (0,4) O (2,3) O (8,0) Next 0870/take/questions/879609 The Crumb and Custard Bakery makes coffee cakes and Danish pastries in large pans. The main ingredients are flour and sugar. There are 25 pounds of flour and 16 pounds of sugar available, and the possible maximum daily demand for coffee cakes is 5. Five pounds of flour and 2 pounds of sugar are required to make a pan of coffee cakes, and 5 pounds of flour and 4 pounds of sugar are required to make a pan of Danish pastries. A pan of coffee cakes has a profit of $1, and a pan of Danish pastries has a profit of $5. Determine the number of pans of coffee cakes and Danish pastries to produce each day so that profit will be maximized. Formulate a linear programming model for this problem. Define X1 as the number of pans of coffee cakes to make each day, x2 as the number of pans of Danish pastries to make each day, and Z as the total daily profit. Which of the following model formulations is correct? Maximize Z-x1+5x2 subject to 5x1+5x2>=25 2x1+4x2-16 x1-0 Maximize Z-x145x2 subject to 5x1+5x2=0 O Maximize Z-x1+5x2 subject to 5x1+5x2=5 x1, x2>=0 O Maximize Z=x145x2 subject to 5x1+5x2=0