Can you only answer letter E and forward please. A-D have completed.

The LP problem whose output follows determines how many necklaces (X1), bracelets (X2), rings (X3), and earrings (X4) a jewelry store should stock. The objective function measures profit; 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 (marketing restriction) OPTIMAL SOLUTION Objective Function Value = 7475.000 Variable Value X1 X2 X3 X4 8.000 0.000 17.000 33.000 Reduced Cost 0.000 5.000 0.000 0.000 Constraint 1 2 3 4 Slack/Surplus 0.000 63.000 0.000 0.000 Dual Price 75.000 0.000 25.000 -25.000 Variable *Lower Limit Current Value *Upper Limit No Upper Limit X1 87.500 100.000 X2 120.000 125.000 No Lower Limit 125.000 120.000 X3 X4 150.000 125.000 162.500 150.000 RIGHT HAND SIDE RANGES Constraint *Lower Limit 100.000 Current Value 108.000 1 2 *Upper Limit 123.750 No Upper Limit 58.000 54.000 57.000 120.000 3 4 8.000 41.500 25.000 50.000 *Lower limit = current value - allowable increase *Upper limit = current value + allowable increase Use the output to answer the questions. a. b. e. f. How many necklaces should be stocked? Now many bracelets should be stocked? How many rings should be stocked? How many earrings should be stocked? How much space will be left unused? How much time will be used? By how much will the second marketing restriction be exceeded? What is the profit? To what value can the profit on necklaces drop before the solution would change? By how can the profit on rings increase the soluti would change? By how much can the amount of space decrease before there is a change in the profit? You are offered the chance to obtain more space. The offer is for 15 units and the total price is 1500. What should you do? j. k. 1