Sedrick Company produces two types of machine parts: X and Y, with unit contribution margins of $450 and $900, respectively. The table below provides the detailed associated constraint data. Part X Resource Usage: per Unit One hour Resource Name Grinding Resource Available 80 grinding hours Drilling 180 drilling hours Polishing 90 labor hours One and one half hours Two hours Market demand: Part X 90 units One unit Market demand: Part Y 150 units Zero units Part Y Resource Usage: per Unit One hour Four and one half hours One hour Zero units One unit Required: 1. Express Sedrick's constrained optimization problem as a linear programming model by completing the following missing data. Round your answers to one decimal place. Max Z=$ 450 X+$ 900 Y subject to Internal constraints: External constraints: X Ys Non negativity constraints: Yz 1 X+ 1 Y (grinding) 1.5 X+ 4.5 Ys 2X+ 1 Y (drilling) (polishing) Corner Point A (intersection of X and Y axes) B (intersection of Y axis and drilling constraint) C (Intersection of drilling and polishing constraints) D (intersection of polishing constraint and X axis) X-Value Y-Value Z= $450X + $900Y 3. The optimal solution produces a total contribution margin of $ 4. The binding constraints are