The following tableau represents a specific simplex iteration. Basic 21 0 22 -5 3 X3 0 0 24 4 25 - 1 2 X6 -10 -1 27 0 X 8 0 Solution 620 12 6 28 -3 5 1 0 0 13 1 1 -2 3 0 1 0 0 -4 3 0 21 1 - 1 0 6 0 0 (a) (5 points) Categorize the variables as basic and nonbasic, and provide the current values of all the variables. (b) (5 points) Assume that the linear program is of maximization type. Is the current basic feasible solution optimal? Explain why. (c) (5 points) Assume that the linear program is of minimization type. Is the current basic feasible solution optimal? Explain why. (d) (10 points) If your answer to part (b) is no and to (c) is yes, complete the next iteration assuming that the linear program is of maximization type. If your answer to part (c) is no and to (b) is yes, complete the next iteration assuming that the linear program is of minimization type. If both of your answers to (b) and (c) are no, choose either case and complete the next iteration. One iteration is sufficient. You do not need to solve the LP to optimal. (Hint: If both of your answers to (b) and (c) are yes, you may want to revisit your answers.]