The feasible region of a linear programming problem is shown below (yellow lines). Put a circle on each corner point and label them A, B, C, ... in any order that you wish. For each of your corner points, indicate the (X,Y) values. With the exception of one corner point, solve 2 equations in 2 unknowns to obtain the coordinates. If you simply look at the graph to obtain the coordinates, you will receive ZERO credit. Determine the optimal solution to the problem. The objective function is 10X+15Y. Be explicit in showing which corner point is optimal. Don't leave me to guess what you mean