Question 2: (35 points) (This question can be solved in 20 minutes easily)Suppose that we have 5 jobs (1, 2, 3, 4, 5) waiting for being performed and 5 machines (A, B, C, D, E) that can be used to perform these jobs. The assignment costs of the jobs to the machines are given in the following table. Find the minimum total cost one-to-one assignment between the jobs and the machines by the Hungarian Method. At the end, write your solution clearly: which job is assigned to which machine and what is the total cost in your solution? (Please give numbers to your tables like Table 1, Table2, ... in order to make it easier to follow your solution) E 2. 1 11 11 3 NM B2991 A 1 19 UM0000 WAND 5 4 7 5 7