The Xecko Tool Company is considering bidding on a job for two airplane wing parts. Each wing part must be processed through three manufacturing stages: stamping, drilling, and finishing for which the company has limited available hours. The linear programming model to determine how many of part 1 (x1) and part 2 (x2) the company should produce in order to maximize its profit is as follows: maximizeZ= $650x1 + 910x2 subject to 4x1 + 7.5x2 105 (stamping, hr.) 6.2x1 + 4.9x2 90 (drilling, hr.) 9.1x1 + 4.1x2 110 (finishing, hr.) x1,x2 0 A.Solve the model graphically. B.Indicate how much slack resource is available at the optimal solution point. C.Solve this model by using Excel. D.What is the Dual Problem?