a. Formulate a linear programming model that produces as many bags of dog food as possible without exceeding the demand or the available supply of raw material. Let X1= number of 4lb. bags of Puppy Blend produced, X2= number of 4lb. bags of Adult Blend produced, X3= number of 4lb. bags of Geriatric Blend produced. Objective function: Maximize: Z=1X1+1X2+1X3. (Enter your responses as whole numbers.) Constraints: b. Reformulate the linear programming model if the company is now interested in maximizing their profit (price - raw material cost) from dog food production. Assume that Puppy Blend sells for $11.00 per bag. Adult Blend sells for $9.50 per bag, and Geriatric Blend sells for $11.50 per bag. Further, Chicken costs $3.00 per pound Fish Meal costs $1.25 per pound, and Soy Flour costs $2.50 per pound. How does this new information change your linear programming model? The new objective function: Maximize: Z=X1+X2+X3. (Enter your responses rounded to two decimal places) More Info