Determine whether the following linear programming problem is feasible or not. If feasible, solve the problem graphically; if not, explain why it is not feasible. minimize z =-3x subject to 2x1 + x 3 3x1222 X2 2 #1, #2 20 (1) (2) (3)