Table 4. Data (seconds to complete task) for assignment of three employees to three positions. Position Employee Loader Operator Binder 10 9 8 B 12 8 9 7 7 Each cell represents the time (in seconds) that a worker (A,B,C) can complete the task listed in the column (Loader, Operator, Binder). The company's objective is to assign workers to positions to minimize True, False, Cannot be determined. A linear programming "Assignment Problem" for assigning workers to positions as shown in table 4 would have 6 (3x2x1 = 6) possible solutions to compare to determined optimality