Question 8
The beaver kingdom consists of six islands A, B, C, D, E and F. A strange disease has appeared on F, and the King needs to send experts from A to help F. To prevent the disease from spreading, the King also restricts travel between islands as shown below.
Travel must follow the arrows. The number of people on each route is limited; each number in the diagram is the maximum permitted to use that route in one day.
| Route | Daily limit |
|---|---|
| A→B | 10 |
| A→C | 10 |
| B→C | 2 |
| B→D | 5 |
| B→E | 3 |
| C→E | 10 |
| E→D | 8 |
| E→F | 10 |
| D→F | 10 |
What is the maximum number of experts who can reach F on the first day?
Travel must follow the arrows. The number of people on each route is limited; each number in the diagram is the maximum permitted to use that route in one day.
| Route | Daily limit |
|---|---|
| A→B | 10 |
| A→C | 10 |
| B→C | 2 |
| B→D | 5 |
| B→E | 3 |
| C→E | 10 |
| E→D | 8 |
| E→F | 10 |
| D→F | 10 |
What is the maximum number of experts who can reach F on the first day?