Match the following with reference to the CNC machine and its minimum number of axes available in the machine.

The starting simplex table of a linear programming problem is given below, where \( S_1, S_2, S_3, S_4 \) are the slack variables. The objective of the problem is
Maximize \( z = 6x_1 + 4x_2 \)
The leaving variable among the basic variables is:

Match the following with reference to the CNC machine and its minimum number of axes available in the machine.

The starting simplex table of a linear programming problem is given below, where \( S_1, S_2, S_3, S_4 \) are the slack variables. The objective of the problem is
Maximize \( z = 6x_1 + 4x_2 \)
The leaving variable among the basic variables is:

