Consider the following small instance of the linear programming problem: a....

Consider the following small instance of the linear programming problem:

a. Sketch, in the Cartesian plane, the problem’s feasible region, defined as the set of points satisfying all the problem’s constraints.

b. Identify the region’s extreme points.

c. Solve this optimization problem by using the following theorem: A linear programming problem with a nonempty bounded feasible region always has a solution, which can be found at one of the extreme points of its feasible region.