Data: Recipes Input (Flour) Output (Cake) Profit (5) Quality A Quality B Chocolate Cake Vanilla Cake 2 4 8 7 100 3 6 9 2 300 Recipe 1 Recipe 2 Recipe 3 Availability 1 5 7 5 200 400 500 Demand 150 Demand 250 The model for the above problem is as follows: Max. Z = C1X1 + C2X2 + C3X3 Max. Z = C1X1 + C2X2 + C3X3 Subject To: + Flour Quality 1 availability Flour Quality 2 availability Chocolate Cake Demand Vanilla Cake Demand Constraint (1) Constraint (2) Constraint (3) Constraint (4) + 9 21X1 + a2x2 a3X3 ? 1 24x1 + 25x2 + a6x3 ? b2 a7x1 + agx2 agx3 ? b3 a10X1+ a11x2 + a12X3 ? b4 X1, X2, X320 Q1) What is the C2 Value 300 Q2) What is the a2 Value 3 Q3) What is the a4 Value 4 V V 300 v Q2) What is the a2 Value 3 V Q3) What is the a4 Value 4 V Q4) What is the ag Value 7 Q5) What is the a11 Value 2 Q6) What is the b1 Value 400 v Q7) What is the b3 Value 150 V Q8) What is the sign of 2nd constraint