multiple optimal b) Larry, Moe and Curly work in a clock factory. Larry and Moe can each work 40 hours per week and Curly can work 20 hours per week. The company makes two types of clocks: grandfather clocks and wall clocks. Each grandfather clock sold results in a profit of $300 and each wall clock sold results in a profit of $200 Larry assembles the clock mechanism, while Moe carves the wood casing Curly takes orders and ships the clocks. The time for these operations is shown in the table below Time Required Operation Grandfather clock Wall clock assembly 6 hours 3 hours carving 8 hours 5 hours shipping 2 hours 2 hours Assume that all clocks made are sold. For the purposes of this problem, assume that fractional values of the decision variables are acceptable. Let , be the number of grandfather clocks made and be the number of wall clocks made. An LP formulation that will provide the number of clocks of each type to be sold follows: Max profit=300x, +200x 5.1. 6x, +3.x, 540 (assembly constraint) 8x, +5x, 340 (carving constraint) 2x, +2x. s 20 (shipping constraint) ...20 For the next 3 problems, suppose we have set the excel solver up to help decide how many grandfather clocks and wall clocks to make. j) If the blue cell (FS) reads "-SUMPRODUCT(B6:C6, B8:C8)" what is the value? k) Suppose I want to add a new constraint that I cannot produce more than twice as many wall clocks as grandfather clocks (XS 2xg). What should be in the grey cells? (B14, C14, D14, and F14) you A D can write formulas or numbers as necessary. 1 Profit Maximization Input or Parameter Decision Variable 3 Clock Factory Constraint B14 Objective Function Decision Clocks X s Clocks X_W Decision C14 Values = to make per 6 D14 Total Pro 300 200 F14: Used 6 week] 7 3 Objective 9 10 Constraints 11 Assembly 12 Carving 13 Shipping 14 Demand Available 40 40 6 8 2 5 0 0 VI VI VI 20 2