Solve the following linear program using the simplex method (Phase I and Phase II). Explain each simplex pivot by showing a complete basis representation or simplex tableau for each extreme point visited. Show which variables are basic and which are not, at each step. Compute the value of the objective function and decision variables at optimality: Z=3x1+2x2 Subject to: 1x1+2x262x15x2102x1+2x22x1,x20