A simplex matrix for a standard maximization problem is given. 102187106510510000100001000012801404200 (a) Write the values of all the variables (use x1,x2,x3, and s1,s2,s3, ) and of the objective function f. x1x2s1s2s3f====== (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. No solution is possible. (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 --- Select--- v next pivot element 0). Do not perform the row operations. 101R12R1+R218R1+R37R1+R4R1R2R3R4[21R2R210R2+R1R118R2+R3R37R2+R4R4[181R3R310R3+R1R12R3+R2R27R3+R4R4 The solution is complete. No new pivot needs to be found and no further row operations are necessary. No solution is possible. No pivot can be found