3. Graphical solutions for integer LPs Y Constr. Constr. 4 B 5 D Constr. Constr. 3 5 X Suppose the feasible region for the 'relaxed version of a linear program is given above. You want to find the integer solution graphically. a) Put 'dots' on all the feasible points if the linear program has the constraints that both X and Y must be integer. If you are not sure if any are included, note that you are unsure about that point or points. (I didn't give you any formulas for the constraints, so you cannot check. In real life you could check to see if it is included or not by seeing if it is on the constraint, or if off the constraint, whether it is in the cor > region compared to the constraint line.) b) The objective function is max 4X+5Y. Graph two objective function lines on the chart above, using DOTTED lines. c) Indicate the direction of maximization. d) Use those lines to find the optimal INTEGER solution. Circle the point or points which are optimal here. e) Using that point or points, what is the value of the objective function at the integer optimal solution