\table[[Problem III,,1,2,3,4],[,A,1,-1,-4,1],[,B,0,-1,-4,0],[,C,1,0,-1,1],[,D,3,2,0,5]] Questions 11 through 20 are based on Problem III (11) The highest number of assignments you can make in Table 4 among the zero cells is : (a) 1 (b) 2 (c) 3 (d) 4 (e) 5 (12) The lowest number of lines needed to cover all the zero cells in Table 4 is equal to: (a) 1 (b) 2 (c) 3 (d) 4 (e) 5 (13) The minimum value of the uncovered elements in Table 4 is equal to: (a) 1 (b) 2 (c) 3 (d) 4 (e) 5 (14) The total number of zero cells in Table 5 is equal to: (a) 8 (b) 10 (c) 11 (d) 13 (e) 14 (15) The number of tables needed to find the optimal solution for this problem is: (a) 4 (b) 5 (c) 6 (d) 7 (e) 8 (16) The total cost of the optimal solution is: (a) 0 (b) 1 (c) -1 (d) 2 (e) 4 (17) This problem has more than one optimal solution. (a) True (b) False (c) Not enough information to decide Hint for questions 18, 19, and 20: Each question refers to a different optimal solution. (18) Suppose A is assigned to job 2 in an optimal solution. Then B must be assigned to job 3. (a) True (b) False (c) Not enough information to decide (19) Suppose B is assigned to job 1 in an optimal solution. Then C must be assigned to job 4. (a) True (b) False (c) Not enough information to decide (20) Suppose C is assigned to job 2 in an optimal solution. Then A must be assigned to job 3. (a) True (b) False (c) Not enough information to decide