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. minimizez=3x1subjectto2x1+x233x1x22x22x1,x20 b. Solve the following linear programming problem graphically. minimizez=3x1subjectto2x1+x233x1x22x1+x21x1,x20 c. Consider the same linear programming problem provided in Part b, except for the objective function. Let the new objective function be minimize 0.5x1+0.5x2. Solve the problem and define the characteristic of the optimal solution. Does the optimal value change as the optimal solution changes