Question: Consider the following linear program:min -3x1 - 2x2 - x3 s.t. x1 + 2x2 + 3x3 = 4 2x1 + 2x2 + x3 = 5 2x1 + x2 = 4 xj = 0 ? j(a) Convert the problem into standard form and construct a basic feasible solution at which(x1,x2,x3) = (0,0,0).(b) Carry out the full simplex implementation of the simplex method, starting at the basicfeasible solution of part (a). Use Bland's rule to determine the pivot element.