The following table lists seven different activities that need to be performed to complete the project. Also listed are the immediate predecessors for each activity and the optimistic, most likely, and pessimistic time estimates for each activity
Activity: A, B, C, D, E, F, G
Predecessor: none, none, A, A, C, D, B,
Optimistic: 3, 2, 5, 6, 3, 1, 8
Most likely: 5, 3, 7, 6, 4, 8, 9
Pessimistic: 7, 4, 15, 6, 5, 9, 10
Sketch and analyze the network associated with this problem. That is, determine the earliest and the latest start and finish and the slack for each activity. Also determine the critical path and the overall project completion time.