D 5.3-1.* Consider the following problem. Maximize Z = X1 - x2 + 2x3, subject to 2x1 - 2x2 + 3x3 - 5 X1+ X2 - X3-3 X1 - X2 + X3-2 and x1 20, X2 2 0, X3 2 0. Let x4, x5, and x6 denote the slack variables for the respective con- straints. After you apply the simplex method, a portion of the fi- nal simplex tableau is as follows: Coefficient of: Basic Right Variable Eq. Z X1 X2 X3 X4 X5 X6 Side Z (0) 0 X2 X6 O - O wce ooo - 0 - N - W X3 (a) Use the fundamental insight presented in Sec. 5.3 to identify the missing numbers in the final simplex tableau. Show your calculations. (b) Identify the defining equations of the CPF solution corre- sponding to the optimal BF solution in the final simplex tableau