Obtain the Simplex table corresponding to the case with the basic variables (S1, X3, S3) for the model given below, by matrix multiplications. Examine whether the best solution has been reached with the obtained table, and if the best solution has not been reached, search for the best solution by continuing the Simplex algorithm. (Note: S1 is the idle variable added to the first constraint, S2 to the second constraint, and S3 to the third constraint.)

Enbz = x1 2x2 + 2x3 + 4x4 2x1 + 4x2 + x3 = 32 X1 2x2 + 2x3 + 2x4 0