Assigning Tasks: A data processing department wishes to assign five programmers to five programming tasks (one programmer to each task). Management has estimated the total number of days each programmer would take if assigned to the different jobs, and these estimates are summarized in the following table.

• (a) Determine the assignment that minimizes the total programmer days required to complete all five jobs.
• (b) Show the network diagram corresponding to the solution in (a). That is, label each of the arcs in the solution and verify that the flows are consistent with the given information.
• (c) How would the solution change if programmer 3 could not be assigned to tasks 2 or 4?

ming Tasks: A data processing department wishes to assign five programmers to five mming tasks (one programmer to each task). Management has estimated the total number ach programmer would take if assigned to the different jobs, and these estimates are rized in the following table. Task 1 2 3 4 5 Programmer 1 2 3 4. 5 50 43 60 54 45 25 30 28 29 32 78 70 80 75 70 64 56 66 60 62 60 72 68 70 75 rmine the assignment that minimizes the total programmer days required to comp bs. the network diagram corresponding to the solution in (a). That is, label each of th Zution and verify that the flows are consistent with the given information. 1242