2 Four of the five students Phil, Quin, Ros, Sue and Tim are to be chosen to make up a team for a mathematical relay race. The team will be asked four questions, one each on the topics A, B, C and D. A different member of the team will answer each question. Each member has to give the correct answer to the question before the next question is asked. The team with the least overall time wins.
The average times, in seconds, for each student in some practice questions are given below.
| Phil | Quin | Ros | Sue | Tim |
| Topic A | 18 | 15 | 19 | 20 | 17 |
| Topic B | 23 | 24 | 22 | 25 | 23 |
| Topic C | 20 | 16 | 18 | 22 | 19 |
| Topic D | 21 | 17 | 18 | 23 | 20 |
- 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 students should be chosen for the team. State which student should be allocated to each topic and state the total time for the four students on the practice questions using this matching.