A linear programming computer package is needed. Kilgore's Deli is a small delicatessen located near a major university. Kilgore does a large walkin 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 profit on one serving of Wimpy is $0.46, on one serving of Dial 911, $0.59. Each sewing oi= Wimpy requires 0.25 pound of beef, 0.25 cup oi= onions, and 5 ounces of Kilgore's speciai sauce. Each sewing of Diai 911 requires [125 pound of beef, [14 cup of onions, 2 ounces of Kilgore's special sauce, and 5 ounces of hot sauce. Today. Kilgore has 21 pounds of beef, 16 cups of onions, 89 ounces of Kilgore's special sauce, and 61 ounces of hot sauce on hand. (a) Develop an LP model that will tell Kilgore how many servings of Wimpy and Dial 91.1 to make in order to maximize his prot today. (Let W = the number of servings of Wimpy to make and let D = the number of servings of Dial 911 to make.) Max 0.46X\" 0.59}? X s.t. Beef 0.253: W 0.25}? g 20 X Onions 0-2536 " 0.40 S 15 X Special Sauce 52: + 2}! S 88 X Hot Sauce 5y 3 50 X maze (b) Find an optimal solution. (Round your answers to two decimal places.) (w,o)=( 12,12 ) X Prot : $ 1236 x (c) What is the dual value for special sauce? [Round your answer to two decimal places.) $ at Interpret the dual value. For every 1 ounce increase in , the prot wili by $ : . (d) Increase the amount of special sauce available by 1 ounce and resolve. {Round your answers to two decimal places.) (w,m=(S) Does the solution conrm the answer to part (c)? 0 Yes O No