Fill in the blank with the correct term. A sort starts by comparing the first item in the list to the remaining items, and swaps where the first item is greater than the later item.

Then it compares the second item in the list to the rest.

This continues until it compares the second last item to the last item.

The initial tableau of a linear programming problem is given. use the simplex method to solve it. x 1 x 2 x 3 s 1 s 2 z 1 2 4 1 0 0 8 3 4 1 0 1 0 10 minus3 minus12 1 0 0 1 0 the maximum is nothing when x 1equals nothing, x 2equals nothing, x 3equals nothing, s 1equals3, and s 2equals0. (be sure to simplify to lowest terms if necessary.)