Question 1: Graphical Solution LP - (15 marks) Consider the following linear program: Graph of the Constraint Lines B Max A + 2B St. (1) 4A + 6B 5 27 (2) 2A-3B 2-3 (3) A+B 1 17 minutes on slide A and B 2 0 and "A" to be integer a) Sketch and place a number (1, 2, or 3) next to each constraint line to identify which constraint it represents. b) Shade in the feasible region (or use the dot or line representation for ILP) on the graph. c) Identify the optimal solution. d) Which constraints are binding? Explain. Each part of this question is worth 3 marks e) Identify (circle)the optimal solution for the relaxation