A linear programming computer package is needed. special sauce, and $5$ ounces of hot sauce. Today, Kilgore has $18$ pounds of beef, $13$ cups of onions, $86$ ounces of Kilgore's special sauce, $7$ and $58$ ounces of hot sauce on hand. make and let $D=$ the number of servings of Dial $911$ to make.$)$

s$.$t$.$

Beef $$

Onions $$

Special Sauce $$

Hot Sauce $$

$w,D0$

$($b$)$ Find an optimal solution. $($Round your answers to two decimal places.$)$

$($c$)$ What is the shadow price for special sauce? $($Round your answer to two decimal places.$)$

$ $$

Interpret the shadow price.

For every $1$ ounce increase in $,$ the profit will $$ by $ $$

$($d$)$ Increase the amount of special sauce available by $1$ ounce and re$-$solve. $($Round your answers to two decimal places.$)$