Use the Assignment Model (Hungarian Method) to assign a job for each employee at the least possible cost J1 J3 J4 J2 JS Steve 38 85 81 29 64 Michael 97 99 87 13 18 Paul 86 79 59 13 90 Carole 24 25 46 66 18 Lisa 91 84 3 59 50 The minimum row clements P1, P2, P3, & P4 are respectively * 29, 13, 13, 1.8, 3 29, 13, 13, 18, 3 29, 13, 13, 18,-3 29, 13, 31, 18, 3 None of the answers. The minimum column elements Q1, Q2 Q3, & Q4 are respectively None of the answers. 6,7,0,0,0 6,7,0, 10,0 6,7,0,0, 1.0 6,7,6, 0, 0 The minimum uncovered number of the ist reduced matrix is * 43 3 21 None of the answers The minimum uncovered number of the 2nd reduced matrix is * None of the answers. 3 2 28 51 3 The optimal job assignment is to assign Steve to J1, Michael to J3, Paul to J4, Carole to J2, & Lisa to J4 Steve to J1, Michael to J4, Paul to J5, Carole to J2, & Lisa to J3 None of the answers. Steve to J1, Michael to J5, Paul to J4, Carole to J2, & Lisa to J3 Steve to J1, Michael to J5, Paul to J4, Carole to J3, & Lisa to J2 The minimum cost of assigning jobs to employees is * $33 None of the answers. $79 $77 $97 An optimal solution of an assignment problem can be obtained only if* each employee is assigned two jobs the data is arrangement in square matrix each row & column has at least one zero element each row & column has one zero element None of the answers. In an Assignment Problem, an optimal solution is reached if the minimum number of covering lines is the number of rows n.* True False In an assignment problem, one can use diagonal lines to cover all the zeros in a reduced matrix. + O True False