Graph of the Constraint Lines 2x+y (0.333, 4) 3) Consider the following linear program: (15 min) (20 marks) Minimize Subject to 2x + 4y 2 12 3x + 2y 29 y 54 x > 0 a) Sketch and place a number (1, 2, or 3) next to each constraint line to identify which constraint it represents. (3 marks) b) Shade in the feasible region on the graph. (4 marks) (1.5, 2.25) (0.3) (6.0) X 1 (3.0) c) Identify the optimal extreme point. What is the optimal value of the objective function? (7 marks) d) Calculate the amount of slack/surplus and explain on which constraints are binding? (6 marks)