Use the Hungarian algorithm (3 × 3 up to 5 × 5 square matrices) to determine the optimum (minimum and maximum) assignment/s for larger practical problems.

A company has three contractors (Contractor 1, Contractor 2, Contractor 3) to assign to three projects (Project A, Project B, Project C). Each contractor can complete only one project. The table shows the cost (in hundreds of dollars) for each contractor to complete each project. Use the Hungarian algorithm to determine which contractor should be assigned to which project to minimise the total cost.

A logistics company has three delivery vans (Van A, Van B, Van C) and three parcels to deliver to three locations (Location P, Location Q, Location R). The table shows the distance in kilometres (km) each van would travel to deliver to each location. Use the Hungarian algorithm to determine the minimum total distance if each van delivers to exactly one location.

A company has three tasks to allocate to three employees. The table shows the estimated completion time in hours (h) for each employee to complete each task. Use the Hungarian algorithm to determine the minimum total time if each employee is allocated one task.