Consider the following two linear programming problems. (a) Maximize the function f(₁,2-2)=-2x₁ + x₂ subject to the constraints 21-22 ≤ 4, 21+ 2x₂ ≤5, 21, 22 20. Solve this problem using the graphical method. (b) Maximize the function g(x₁.2, 3) = 3r₁ +42 +2r3 subject to 2x1+2+3x3 ≤ 10, 5x+3x2+2x3 15, 1, 72, 73 20. Solve this problem using the simpler algorithm.