(A) Write the values of all the variables, (B) Indicate wheater or not the solution from part (a) is complete, (C) If the solution is not complete, find the next pivot, (D) When a new pivot can be found, state all row operations

6.66 Points] DETAILS HARMATHAP12 4.3.011. MY NOTES ASK YOUR TEA A simplex matrix for a standard maximization problem is given. 201 3 16 4 3 1 51 -90 0 8 1 90 (a) Write the values of all the variables (use X1, X2, X3, . . . and $1, $2, $3, . . .) and of the objective function f. X1 = X2 = $1 = $2 = F = (b) Indicate whether or not the solution from part (a) is complete (optimal). Yes, the solution is complete (optimal). No, the solution is not complete. (c) If the solution is not complete, find the next pivot or indicate that no solution exists. (If an answer does not exist, enter DNE.) row number of next pivot column number of next pivot next pivot element When a new pivot can be found, state all row operations with that pivot (that is, row operations that make that pivot equal to 1, and then make other entries in the pivot column equal to 0). Do not perform the row operations. R1 - R1 -3R1 + R2 - R2 9R1 + R3 - R3 1R2- R2 -2R2 + R1 - R1 -9R2 + R3 - R3 4 R1 - R1 1R1 + R2- R2 - 8R1 + R3 - R3 3 R2 - R2 SR2 + R1 - R1 8 R2 + R3 - R3 The solution is complete. No new pivot needs to be found and no further row operation