Question 5 20 Marks A company has 4 machines to do 4 jobs. Each job can be assigned to one and only one machine. Also, every machine must be assigned only to one job. The cost of each job on each machine is given below: Jobs 1 2 Machines 3 A 5 6 1 B 11 8 4 423 C 6 7 9 1 D 3 5 2 3 Using Hungarian algorithm, determine the assignment schedule, which minimizes the total cost.