The following linear program determines how many necklaces (X1), bracelets (X2), rings (X3), and earrings (X4) a jewelry store should stock. The objective function measures profit (in dollars); it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Constraints 3 and 4 are marketing restrictions. LINEAR PROGRAMMING PROBLEM MAX 100X1+120X2+150X3+125X4 S.T. 1) X1+2X2+2X3+2X450 Here is the Answer Report: : Objective Cell (Max) Cell Name $B$36 Total Profit Original Value Final Value 445 7600 Variable Cells Cell Name $A$32 Necklaces $ $B$32 Bracelets $C$32 Rings $D$32 Earrings Original Value 1 1 1 1 Final Value Integer 20 Contin 20 Contin O Contin 30 Contin Constraints Cell Name $B$40 Display Space $B$41 Time $ $B$42 Marketing 1 $B$43 Marketing 2 Cell Value Formula Status Slack 120 $B$40=$D$43 Not Binding 10 >=D And here is the Sensitivity Report: Variable Cells Cell Name $A$32 Necklaces $B$32 Bracelets $C$32 Rings $D$32 Earrings Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 20 0 0 120 120 0 20 0 0 80 1E+30 20 0 -75 125 75 1E+30 30 0 120 0 0 75 Constraints Cell Name $B$40 Display Space $B$41 Time $B$42 Marketing 1 $B$43 Marketing 2 Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 120 60 120 120 20 130 0 130 60 20 20 20 20 20 50 0 0 40 10 1E+30 90 Based on this information, answer each of the following questions: a) How many rings should be stocked? b) How much space will be left unused? c) What is the total profit? d) You are offered the chance to obtain more space. The offer is for 10 units and the total price is 1,000. What should you do