apply the big m method to the following linear programming problem, create a table by appropriately adding slack, surplus, and artificial variables, then execute iteration $($select entering and exit variables, execute pivot$)$ on one side. In Interaction $0,$ x$5,$ x$6,$ x$7,$ and x$8$ are basic variables.

he table below shows the table when the optimal solution is reached by executing the big m method. Count from $1$ to $4$ in the blank