Question 1: Graphical Solution LP - (15 marks) Consider the following linear program: Graph of the Constraint Lines 8 Max A+B Subject to: (1) 3A - 3B 2-1 (2) 2A + 3B 2 8 17 minutes on slide (3) A + 2B 5 10 (4) A55 A and B 2 0 and both "A and B" 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) Identify the feasible solution set (use the dot or line representation for ILP) on the graph. c) Identify the optimal solution for the ILP. Each part of the question werthur d) Which constraints are binding? Explain. e) Identify (circle) the optimal solution for the LP relaxation problem. est : Codict the following Mass A321 (2) 2323 A 23 16 Ass And 120 Skal place line todelli by Identity the pran clientify the dy Wid el turcester problem A