please explain options a,b,c,d clearly. thx a lot!!!

Q.4. (28 points) Consider the following problem. Max4x1+8x2+6x3s.t.3x1+x2+2x320x1+x2+2x322x1+x218x1,x2,x3,0 (a) (4) Write the dual of the problem (b) (8) Solve the problem using the Tableau Method. At each iteration of the algorithm, identify B1, and w=cBB1. (c) (8) At each iteration of the tableau method, state whether w is feasible to the dual or not. If not feasible, state which constraints of the dual problem does w violate and how much? Do you see any hint in the tableau of that iteration? (d) (8) At each iteration of the algorithm show that the complementary slackness condition holds