OD 9 D t 18 B 26 D 306 378 650 $400 B $400 D $525 B $575 DData table In each department, the time required per batch and the total time available each day are as follows: A B C D Department Minutes 2 Mixing Filling Baking 3 Daisy's Delight 26 O 9 4 Bridget's Bourbon 18 18 18 5 Total available per day 650 306 378Data table Revenue and cost data for each type of cookie are as follows: 1 Revenue per batch 2 Variable cost per batch 3 Contribution margin per batch Monthly xed costs {allocated to 4 each product] $ Daisy's Delight Bridget'e Bourbon Daisy Simpson, Inc., sells two popular brands of cookies: Daisy's Delight and Bridget's Bourbon. Daisy's Delight goes through the Mixing and Baking departments, and Bridget's Bourbon, a filled cookie, goes through the Mixing, Filling, and Baking departments. Michael Shirra, vice president for sales, believes that at the current price, Daisy Simpson can sell all of its daily production of Daisy's Delight and Bridget's Bourbon. Both cookies are made in batches of 3,400. (Click the icon to view the time required per batch and the total time available.) (Click the icon to view the revenue and cost data.) Read the requirements. Requirement 1. Using D to represent the batches of Daisy's Delight and B to represent the batches of Bridget's Bourbon made and sold each day, formulate Shirra's decision as an LP model. Begin by determining the linear function. Total contribution margin = Next specify the constraints for each department. (If an input field is not used in the table, leave the input field empty; do not select a constraint.) Mixing Department: Filling Department Baking DepartmentRequirement 2. Compute the optimal number of batches of each type of cookie that Daisy Simpson, Inc., should make and sell each day to maximize operating income. Calculate the total contribution margin for each corner point, then we can select the optimal number of batches. (For trials with a $0 balance, make sure to enter "0" in the appropriate field.) Total Trial Corner (D,B) Contribution Margin (0,0) 2 (25,0) 3 (16,13) (8, 17) (0,17) Select the corner point that represents the optimal number of batches of each type of cookie, to maximize operating income. Corner (D,B) =Requirement 2. Compute the optimal number of batches of each type of cookie that Daisy Simpson, Inc., should make and sell each day to maximize operating income. Calculate the total in for each corner point, then we can select the optimal number of batches. (For trials with a $0 balance, make sure to enter "0" in the appropriate field.) Trial Corner (D (0,0) n Margin (0,0) (25,0) (25,0) 3 (16,13) (16,13) A (8,17) (8,17) 5 (0, 17) Select the corner p (0, 17) hits the optimal number of batches of each type of cookie, to maximize operating income. Corner (D,B) =