Question 1: Construct a network information from the information in the following table and identify all the paths in the network, compute the length of each, and indicate the critical path.
| Activity |
|
Activity Predecessor |
Time (Weeks) |
| 1 |
|
- |
|
|
7 |
| 2 |
|
- |
|
|
10 |
| 3 |
|
1 |
|
|
6 |
| 4 |
|
2 |
|
|
5 |
| 5 |
|
2 |
|
|
4 |
| 6 |
|
3.4 |
|
|
3 |
| 7 |
|
5.6 |
|
|
2 |
Question 2: Determine the earliest start and finish times, latest start times, and slack for each activity. Indicate how the critical path would be determined from this information.