Solve the linear programming problem below by showing the graph of the feasible region and corner points. Post your solution by the due date. You'll have a few additional days to make edits, if you choose. I strongly encourage you to use DESMOS for this activity. A contractor builds storage sheds in two high end models, the Chelan and the Orondo. Each Chelan model requires: - 2000ft of framing lumber - 6000 cubic feet of concrete - $4000 for advertising Each Orondo model requires: - 4000ft of framing lumber - 6000 cubic feet of concrete - $6000 for advertising Contracts call for using at least 16000ft of, framing lumber, 36,000 cubic feet of concrete, and $30,000 worth of advertising. If construction cost for each helan shed is $40,000, and the construction cost for each Orondo shed is $30,000, how many of each model should be built to minimize construction costs? Your solution must include the following: 1. The objective equation and constraints as inequalities. 2. A graph of the feasible region. Label each corner point labeled, or a list them. 3. The number of each model that should be build to minimize costs. 4. The minimum cost. 5. What was the hardest part of this assignment for you? What part was the easiest? Here are some hints to get you off to the right start: - Let X= number of Chelan models built: Y= number of Orondo models built - Objective function (equation) is construction cost - You need 3 constraints (inequalities): one for lumber, one for concrete, and one for advertising