hello good day.please the bellow question was been answer by an expert. but please need handwritten answer for the bellow question.

please answer all question from A to D

Consider the following LP: maxz=s.t.3x1+x24x1+x242x1+x24x1+x2=3x1,x20 (a) Solve the problem graphically (b) Solve the LP using the Big M method. (c) Identify in each step of the algorithm the basic solution, indicate if it is feasible, state the objective function value and plot the point in the graph. (d) Is the problem unbounded, infeasible, does it has a unique optimal solution or alternative optimal solutions