### Simplex Algorithm Problem

6. Consider the problem maximise 2x_1 + 3x_2 + x_3 subject to x_1 + 2x_2 + 3x_3 + x_4 = 6 2x_1 + x_2 + 2x_3 + x+5 = 4 x_1, ..., x_5 >= 0 with initial tableau: 1 2 3 1 0 | 6 2 1 2 0 1 | 4 ------------- 2 3 1 0 0 | 0 and final tableau: . . . 2/3 -(1/3) | . . . . -(1/3) 2/3 | . --------------------- . . . -(