Determine whether the following linear programming problem is infeasible, unbounded, or ...

Determine whether the following linear programming problem is infeasible, unbounded, or has multiple optimal solutions. Draw a graph to find the feasible region ( if it exists) and explain your conclusion.

Maximize z = 20x + 25 y

subject to

2x + y <=15

x>=10

y<=5

x, y >=0