For the mathematical linear programming problem, maximize Z = 5x + 3y subject to the
constraints x +2y ≤ 8, x + 4y ≥ 8, x ≥ 0, y ≥ 0 (A) Graph the feasible
region of the problem. (B) Find whether the feasible region is bounded or unbounded.
(C) Use Corner Point Method to determine the maximum value of Z.