Consider the following linear programing problem:

max $z=x+3y$ and min $z=x+3y???$

$s.t.$

$x+2y6$

$x+y4$

$x,y0$

The constraints are sketched in the following graph

Which one of the following labels best indicate the feasible region described above?

The optimal solution of the problem above is $x=$

and $z=$