Does the linear programming problem involve infeasibility, unbounded, and/or alternative optimal solutions?

Does the linear programming problem involve infeasibility, unbounded, and/or alternative optimal solutions? Your answer should clearly denote whether or not each numbered area is the feasible region or not and justify why. Again, craft your answer as if you are a textbook author.
Suppose that the objective function is changed to Min z = 40x1 + 50x2. Is the modified linear programming problem infeasible, unbounded, or exhibiting alternative optimal solutions. If not, clearly show your steps for substitution to find the optimal solution. Be sure to denote what number represents the feasible region and justify your selection.

Files: Irregular.jpg