Please help with the following optimization problem (duality in linear programming):

(a) Formulate the dual to the linear program below. (b) Solve the primal program (either graphically or by simplex method). (0) Find the shadow prices corresponding to primal optimal solution. Show that they solve the dual problem. Primal max z = 21:1 + 9:2, s.t. 12331 + 932 S 6, 3$1 + 132 S 7: 9:2 3 10, $11132 2 0