Let x1 tons of steel 1 produced, x2 tons of steel 2 produced and x3 tons of steel 3 produced. Now to maximized profit should solve the following Linear Programming: Maxz=8x1+5x2+2x3 Subject to, 3x1+2x2+x3200x1+x340x1+x2+x3100x1,x2,x30(CoalRequired)(IronRequired)(LaborRequired) a) What would profit be if only 40 tons of iron could be purchased? b) What is the smallest price per ton for steel 3 that would make it desirable to produce it? c) Find the new optimal solution if steel 1 sold for $55 per ton