3 [Figures 1 and 2, printed on the insert, are provided for use in this question.] A building project is to be undertaken. The table shows the activities involved.
| Activity | Immediate Predecessors | Duration (days) | Number of Workers Required |
| A | - | 2 | 3 |
| B | A | 4 | 2 |
| C | A | 6 | 1 |
| D | \(B , C\) | 8 | 3 |
| E | C | 3 | 2 |
| F | D | 2 | 2 |
| G | D, E | 4 | 2 |
| H | D, E | 6 | 1 |
| I | \(F , G , H\) | 2 | 3 |
- Complete the activity network for the project on Figure 1.
- Find the earliest start time for each activity.
- Find the latest finish time for each activity.
- Find the critical path and state the minimum time for completion.
- State the float time for each non-critical activity.
- Given that each activity starts as early as possible, draw a resource histogram for the project on Figure 2.
- There are only 3 workers available at any time. Use resource levelling to explain why the project will overrun and state the minimum extra time required.