7. 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 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. A pan of coffee cakes has a profit of $1, and a pan of Danish has a profit of $5. Determine the number of pans of cakes and Danish to produce each day so that profit will be maximized. a. Formulate a linear programming model for this problem. b. Solve this model by using graphical analysis. 8. In Problem 7, how much flour and sugar will be left unused if the optimal numbers of cakes and Danish are baked? 9. Solve the following linear programming model graphically: maximize Z = 3x1 + 6x2 subject to MGMT 315 Exercise #2 Your Name Refer to Problem #7 (Crumb and Custard Bakery) on pages 64 and 65 to answer the following questions: 1. Define the Decision Variables for this problem: 2. Define the Objective Function for this problem: 3. Define ALL of the Constraints for this problem: 4. Write the LP Model in the correct format (as we do for every problem):