Problem 2. A company that operates 10 hours a day manufactures two products on three sequential processes. The following table summarizes the firms operating data: Minutes per hour Product Process 1 Process 2 Process 3 Unit profit 1 10 5 5 $2 2 5 20 10 $3 a) Formulate a linear programming model to determine the optimal mix of the two products. Assume sequential processes means product moves from one process to the next with whatever in-process inventory required present and each process is available 10 hours per day. b) Graphically solve the model in a). c) Give the shadow price of each constraint d) Give the range of variation on each shadow price given the current optimal solution. e) Give the range of variation on each objective function coefficient