Determine whether the following linear programming problem is infeasible, unbounded

Given that the optimal solution of the following linear programming problem is x = 15 and y = 10, State the problem in standard form and do a constraint analysis for the optimal solution.

Maximize z = 50x + 40y

Subject to

4x + 2y ? 80

3x + 5y ? 60

y ? 10

x, y ? 0

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