A. Solve the following linear programming problem. Restrict x 0 and y 0. Maximize f = 2x + 3y subject to x +y7 2x + y 10 y 6. (x, y) = F= B. Solve the following linear programming problem. Restrict x 0 and y 0. Maximize f = 2x + 9y subject to x + y 7 2x + y 12 x + . (x, y) = F= C. Solve the following linear programming problem. Restrict x 0 and y 0. Minimize g = 30x + 60y subject to the following. 11x + x + 15 210 y 3y 24 3y 15 (x, y) = G= D. Solve the following linear programming problem. Restrict x 0 and y 0. Minimize g = 32x + 16y subject to the following. x + x + 2 + x y 100 y 20 3 30 y (x, y)= G=