Unsaved Jungle Figures, Inc. produces two models of its stuffed giraffes, which it markets to high-end retail stores. The large giraffe requires 2 pounds of stuffing material and 6 minutes of machine time. The small giraffe requires 1 pound of stuffing material and 12 minutes of machine time since its tighter stitching pattern requires it to be stitched twice. There are 800 pounds of stuffing and 70 machine hours available each week. By adhering to a policy of not producing more than twice the number of large giraffes as small giraffes (this is a constraint), Jungle Figures has been able to sell all the giraffes it produces at $12 per large giraffe and $9 per small giraffe. A linear programming model is formulated to maximize Jungle Figures’ weekly profit from the manufacturing of the giraffes. MAX 12X1 + 9X2 ST 2X1 + X2 ? 800 .1X1 + .2X2 ? 70 X1 - 2X2 ? 0 Set up the model in Excel and solve for the optimal solution using Solver. In the boxes below, enter the optimal values of X1 (first box) and X2 (second box).