We have 6 tasks to be performed and each task requires a worker. Worker capabili differ as do task requirements. The value of assigning a particular worker to a particular task is listed in the following table. 5 4 6 Worker Task 1 A 12. B 21 6 2 4 23 7 5 3 5 41 6 8 15 6 7 11 10 2 33 9 8 O 4 6 6 D E F 9 5 8 7 9 11 11 14 7 12 13 6 10 9. Use Hungarian Algorithm to solve this problem, when executing the second step the very first time, how many lines are used to cover all the zero elements? A. 3 B. 4 C. 5 D. A feasible solution is found, no need to use lines 10. Use Hungarian Algorithm to solve this problem, in the final matrix that yeilds a feasible solution, what is the second largest entry? A. 17 B. 18 C. 24 D. 26 11. Will only one optimal solution be found? A. Yes B. No 12. What is cost of the optimal solution found by Hungarian Algorithm? A. 40 B. 41 C. 42 D. 43