Kilgore's Deli is a small delicatessen located near a major university. Kilgore's does a large walk-in carry-out lunch business. The deli offers two luncheon chili specials, Wimpy and Dial 911. At the beginning of the day, Kilgore needs to decide how much of each special to make (he always sells out of whatever he makes). The prot on one serving of Wimpy is $0.47, on one serving of Dial 911, $0.6. Each serving of Wimpy requires 0.27 pound of beef, 0.27 cup of onions, and 7 ounces of Kilgore's special sauce. Each serving of Dial 911 requires 0.27 pound of beef, 0.42 cup of onions, 4 ounces of Kilgore's special sauce, and 7 ounces of hot sauce. Today, Kilgore has 22 pounds of beef, 17 cups of onions, 90 ounces of Kilgore's special sauce, and 62 ounces of hot sauce on hand. a. Develop a linear programming model that will tell Kilgore how many servings of Wimpy and Dial 911 to make in order to maximize his profit today. If required, round your answers to two decimal places. For subtractive or negative numbers use a minus sign even if there is a + sign before the blank. (Example: -300) Let W = number of servings of Wimpy to make D = number of servings of Dial 911 to make Max W + D s.t. W + D (Beef) W + D (Onions) W + D (Special Sauce) W + D (Hot Sauce) W, D 2 0 b. Find an optimal solution. If required, round your answers to two decimal places. W = D = Profit = $ c. What is the shadow price for special sauce? If required, round your answers to two decimal places