1 Five trainers, Ali, Bo, Chas, Dee and Eve, held an initial training session with each of four teams over an assault course. The completion times in minutes are recorded below.
| Ali | Bo | Chas | Dee | Eve |
| Team 1 | 16 | 19 | 18 | 25 | 24 |
| Team 2 | 22 | 21 | 20 | 26 | 25 |
| Team 3 | 21 | 22 | 23 | 21 | 24 |
| Team 4 | 20 | 21 | 21 | 23 | 20 |
Each of the four teams is to be allocated a trainer and the overall time for the four teams is to be minimised. No trainer can train more than one team.
- Modify the table of values by adding an extra row of values so that the Hungarian algorithm can be applied.
- Use the Hungarian algorithm, reducing columns first then rows, to decide which four trainers should be allocated to which team. State the minimum total training time for the four teams using this matching.