2 P62682RA 1. Four workers, A, B, C and D, are to be assigned to four tasks, 1, 2, 3 and 4. Each worker must be assigned to exactly one task and each task must be done by exactly one worker. Worker A cannot do task 3 and worker B cannot do task 4 The table below shows the profit, in pounds, that each worker would earn if assigned to each of the tasks. 1 2 3 4 A 29 20 – 23 B 32 30 28 – C 35 32 34 25 D 29 31 27 30 (a) Reducing rows first, use the Hungarian algorithm to obtain an allocation that maximises the total profit. You must make your method clear and show the table after each stage. (7) (b) Determine the resulting total profit. (1) (Total for Question 1 is 8 marks)