Graph of the Question 1: Graphical Solution LP - (15 POINTS) Consider the following linear program: B -4 Max A+ 3B S.t. 3A + 6B 2 17 5A - 3B S 10 A+B 22 3 A and B 2 0 and B is integer The figure to the right shows the constraint lines. 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 extreme point. What is the optimal solution? d) Which constraints are binding? Explain. 0 15 minutes on slide