please give clear step by step explanation and do not copy other answer since they are not correct, thank you, i will give you a thumb up

2. Consider the following LP problem: max = z = 3x1 + 2x2 + x3 X1 + x2 + x3 40 X1 + x2 > 10 X1, X2, X3 > 0 2p 2p 2.1 Convert the problem to standard form. 2.2 Form the Phase One problem from the linear program you formulated in 2.1. 2.3 Solve the Phase One problem using tableaus. For each iteration indicate the entering and leaving variables. 3p 2.4 Does the original LP problem have an initial feasible solution? If so, solve the Phase Two part of the problem using the simplex method. For each iteration write out the tableau and indicate the pivot element. 3p