Methods of solving LPP: a graphical method

You have the following linear programming problem:

$$Maximize \ z = 2x_1 + 3x_2$$

Subject to the following constraints:

$$x_1 + x_2 \ge 2 \\ x_1 - x_2 \ge 0 \\ x_1, x_2 \ge 0$$The constraints of the LPP when graphed gives the following:

Determine the feasible region and whether the solution is bounded or unbounded.

Output format:

A Bounded