please hand solve and show steps

objective m constraints n decision variables Primal: max CX ++Cjxj + Cnxn a/1 x + a2X2 + ai1 X1 + a2X2 + a1 X1 + a2X2 + +ainxn bi + ainxn = bi + ainxn 2 bi (i=1,...,m) xj0 xj urs x 0 (j=1n) min z = 4x1 + x2 + x3 s.t. 3x1 + x2 + x3 6 - 2X1 X3 -3 X X2 X1 + 2x2 X1 0, X2 0, X3 urs 3x3 6 - Primal and Dual pair min by+ +biyi++bmym Vi 20 Y; urs Yi 0 (i=1,...,m) www ajY + a2jY2+ +amjYm Cj ajY1 + a2jY2+.... +amjym=Cj +amjym Cj ajY1 + a2jY2+ (= 1,...,n) objective m decision variables n constraints