Question 3 First Bread operates on a 5-day workweek and manufactures two products: Baguettes and Ciabatta. To produce each Baguette, it necessitates 5 ounces of flour, 1.2 ounce of yeast, and 2 tablespoons (TS) of sesame seeds. For Ciabatta, the ingredients include 4 ounces of flour, 1.3 ounce of yeast, and 3 TS of sesame seeds. The company has a daily inventory of 5400 ounces of flour, 1200 ounces of yeast, and 4600 TS of sesame seeds at its disposal. Baguette yields a profit of 22 cents per unit, while Ciabatta generates a profit of 29 cents per unit. The formulation of this problem should satisfy four requirements for standard Linear Programming 1. There are limited resources and there is an explicit objective function 2. The equations are linear 3. The resources are homogenous (everything is in one unit of measure) 4. The decision variables are divisible and nonnegative (we can make a fractional part of each case) (i) Formulate this problem as a Linear Programming problem. (ii) Represent this problem in graphical format and highlight the feasible region. (iii) Use Simplex Algorithm (Excel) to determine the optimal number of each product that First Bread can produce per week and also the total profit resulting, assuming it can sell all products. Interpret the optimal solution and the results for sensitivity analysis.