3. (a) Four workers A, B, C, D are to be assigned four tasks (K, L, M, N). Each worker must only be assigned one task and each task can only be completed by a single worker. The cost, in , for allocating each worker to each task is shown in Table 2. Table 2 () L M N 36 52 49 28 B 44 46 42 43 50 38 45 48 D 40 49 43 47 i. Use the Hungarian Algorithm to find the optimum allocation. State the minimum cost. (4 marks) ii. Sketch a bipartite graph to show what task each worker is to complete. (2 marks)