3. A project consists of 11 activities, some of which are dependent on others having been completed. The following precedence table summarises the relevant information.
| Activity | Depends on | Duration (hours) |
| A | - | 5 |
| B | A | 4 |
| C | A | 2 |
| D | B, C | 11 |
| E | C | 4 |
| \(F\) | D | 3 |
| G | D | 8 |
| \(H\) | D, E | 2 |
| I | \(F\) | 1 |
| J | \(F , G , H\) | 7 |
| \(K\) | \(I , J\) | 2 |
- Draw an activity network for the project.
- Find the critical path and the minimum time in which the project can be completed.
Activity \(F\) can be carried out more cheaply if it is allocated more time.
- Find the maximum time that can be allocated to activity \(F\) without increasing the minimum time in which the project can be completed.