(Solved): help please quickly please just g) answer option I want an explanation Consider the follow ...

Consider the following problem. Maximize \( Z=2 \times 1+5 \times 2+3 \times 3 \) subject to \[ \begin{array}{l} x 1-2 \times 2+x 3 \geq 20 \\ 2 \times 1+4 \times 2+x 3=50 \\ \text { and } \\ x 1 \geq 0, x 2 \geq 0, \times 3 \geq 0 \end{array} \] (a) Using the Big M method, construct the complete first simplex tableau for the simplex method and identify the comesponding initial (artificial) basic feasible solution. Also identify the initial entering basic variable and the leaving basic variable. (b) Work through the simplex method step-by-step to solve the problem. (c) Using the two-phase method, construct the complete first simplex tableau for phase 1 and identify the corresponding initial (artificial) basic feasible solution. Also identify the initial entering basic variable and the leaving basic variable. (d) Work through phase 1 step-by-step. (e) Construct the complete first simplex tableau for phase 2. (f) Work through phase 2 step-by-step to solve the problem. (g) Compare the sequence of BF solutions obtained in part (b) with that in parts (d) and (f). Which of these solutions are feasible only for the artificial problem obtained by introducing artificial variables and which are actually feasible for the real problem?