2 A farmer has five fields. He intends to grow a different crop in each of four fields and to leave one of the fields unused. The farmer tests the soil in each field and calculates a score for growing each of the four crops. The scores are given in the table below.
| Field A | Field B | Field C | Field D | Field E |
| Crop 1 | 16 | 12 | 8 | 18 | 14 |
| Crop 2 | 20 | 15 | 8 | 16 | 12 |
| Crop 3 | 9 | 10 | 12 | 17 | 12 |
| Crop 4 | 18 | 11 | 17 | 15 | 19 |
The farmer's aim is to maximise the total score for the four crops.
- Modify the table of values by first subtracting each value in the table above from 20 and then adding an extra row of equal values.
- Explain why the Hungarian algorithm can now be applied to the new table of values to maximise the total score for the four crops.
- By reducing rows first, show that the table from part (a)(i) becomes
| 2 | 6 | 10 | 0 | \(p\) |
| 0 | 5 | 12 | 4 | 8 |
| 8 | 7 | 5 | 0 | \(q\) |
| 1 | 8 | 2 | 4 | 0 |
| 0 | 0 | 0 | 0 | 0 |
State the values of the constants \(p\) and \(q\). - Show that the zeros in the table from part (b)(i) can be covered by one horizontal and three vertical lines, and use the Hungarian algorithm to decide how the four crops should be allocated to the fields.
- Hence find the maximum possible total score for the four crops.