QUESTION 1 Formulation Problem: A pastry chef at a bakery wants to find the best mix of two cake recipes (Recipe 1 & Recipe 2) by using flour quality A & B in each recipe in order to maximize the Profit per cake recipe Profit for recipes (Recipo 1 & Recipe 2) are shown in the last column of the table below. Maximum availability of flour quality A & quality B are shown in the table below. Minimum Demand for cake: Cake 1 & Cake 2 units are also listed in the table below. Formulate as LPP (But do not solve it). Data: Recipes Toput (Flour) Output (Cake) Profit (S) Col Sense and submit to and mich Saue Alters to me alone --Out Com Duably Check Vanilla Cake 2 4 7 100 3 6 2 300 Recipe 1 Recipe Recipe Availability 1 5 200 7 5 Demand 150 Demand 100 500 250 The model for the above problem is as follows: Max. Z = C4X1+C2X2 + C3x3 Subject to: 29X1 + a2x2 + 3x3 ? 1 24X1 + 25x2 + 2x3 2 2 ayx1 + agx2 + agx3 ?b3 210X4+ 211x2 +212X3 ? b4 X1, X2, X320 Flour Quality 1 availability Flour Quality 2 availability Chocolate Cake Demand Vanilla Cake Demand Constraint (1) Constraint (2) Constraint (3) Constraint (4) di Sane and Salmon and Co Save Astor inutes, 24 seconds. Question Completion Status: X1, X2, X320 Q1) What is the C3 Value Q2) What is the a10 Value Q3) What is the ag Value Q4) What is the a6 Value Q5) What is the a3 Value Q6) What is the b2 Value Q7) What is the b3 Value Q8) What is the sign of 1st constraint? Click Save and Submit to save and submit Click Save All Answers to sa