Consider the following linear programming problem:

MAXIMIZE $81+22$

subject to

$21-6212$

$51+4240$

$x1+2212$

$x26$

$x1,x20$

Graph the problem, find the feasible region, and identify all corner points of the feasible region. Use the objective function to determine which of the following solution is optimal:

$124$

$49\mathrm{.}3$

$204$

$96$

$12$

Unbounded