Please solve for problem #2 add the graph of the new finishing constraints on the graph for the base case below label the two new comer points as a and b.

#3 determine the optimal solution for the problem with the new finishing constraints calculate the objective function at point ABC and D

#4 Calculate the shadow price as the difference between the optimal profit (the highest among the four in question 2) the optimal profit of the base case (the highest among the four in the base case).

1.Suppose that the finishing constraint now has 19 instead of 18 labor hours limit. Write he new finishing constraint. x+y=19y=0x+y=0y