Solve the following LPs using the simplex method (use both the Big-M Method and the Two-Phase Method to verify that they yield the same conclusion). Comment on whether the problem is feasible or not. If the problem is feasible, then comment on whether the optimal objective function value is bounded or unbounded. If the problem is feasible and the optimal objective function value is unbounded, then find a direction of unboundedness. If the problem is feasible and the optimal objective function value is bounded, then comment on whether the optimal solution is unique or there are multiple optimal solutions.

Please show step by step.

maxs.t.3x1+1x2+3x31x1+2x2+x324x1+1x2+2x38x1,x2,x30