Consider the three-variable linear programming problem shown in Fig. 5.2

Use the sets of defining equations from part (b) to demonstrate that (4, 2, 4), (0, 4, 2), and (2, 4, 0) are indeed adjacent to (2, 4, 3), but that none of these three CPF solutions are adjacent to each other. Then use the sets of non-basic variables from part (b) to demonstrate the same thing.