Question: Consider the following linear programming problem.

\[\begin{aligned} & \max \,\,\,2x+y \\ & \text{s}\text{.t}\text{.} \\ & 4x+y\le 40 \\ & 4x+3y\le 60 \\ & x+2y\le 30 \\ & x,y\ge 0 \\ \end{aligned}\]

a. Use a graph to show each constraint and the feasible region

b. at are the extreme points?

c. at is the optimal solution?

d. at is the optimal value of the objective function?