Graph the following linear programming problem and then solve it algebraically: Minimize the objection:

Graph the following linear programming problem and then solve it algebraically:

Minimize the objection: z = x + 2y

Subject to the following constraints -

     2x +  y ≤ 10

      3x + 2y ≥ 6

      x -  y ≥ 0

      x ≥ 0, y ≥ 0

Remember when you graph, you MUST SHOW all the work including marking all the points, showing all the arrows, writing down equations for each line, indicating the feasible region,