Construct Linear Programming Problem $($LPP$)$ according to the digits of your roll number $2201904$

Maximize $z=(a-g)x_1+(b-f)x_2$

Subject to the constraints

$(a+g+d)x_1+(b+f-d)x_{2}e+f+g$

$(b+f+d)x_1+(c+e-d)x_2=e-f+g$

$(c+e+d)x_1+(a+g-d)x_{2}e+f-g$

$x_{1}0,x_{2}0$

CA$-2$ Solve by Two phase method this question is from advance optimization techniques in engineering maths department and i need solution in step by step