2 The daily costs, in pounds, for five managers A, B, C, D and E to travel to five different centres are recorded in the table below. Using the Hungarian algorithm, each of the five managers is to be allocated to a different centre so that the overall total travel cost is minimised.

1. By reducing the rows first and then the columns, show that the new table of values is

   3	6	3	6	0
   4	0	6	0	2
   6	4	3	6	0
   2	3	8	3	0
   0	2	0	0	2

2. Show that the zeros in the table in part (a) can be covered with three lines and use adjustments to produce a table where five lines are required to cover the zeros.
3. Hence find the two possible ways of allocating the five managers to the five centres with the least possible total travel cost.
4. Find the value of this minimum daily total travel cost.