Max 3A + 2B S.C. (1) 3A + 48 515 (2) 4A-38 56 (3) B21 -2 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) Shade in the feasible region (or use the dot or line representation for ILP) on the graph. c) What is the optimal solution? (circle the point) d) Calculate the amount of slack/surplus for each constraint. ol 15 minutes on slide MacBook Air