Consider the following network for a small maintenance project (all times are in days) Activity Immediate Optimistic Predecessor(s) Time (a) Most Likely Time (m) Pessimistic Time (b A B D E F G H A B, E, F D G 2 5 5 3 2 3 8 5 3 6 6 4 3 4 10 6 4 7 7 5 4 5 16 7 A. Draw an activity network for the project. (8 marks) B. Calculate the: i. expected completion time (to the nearest day) for each activity (5 marks) ii. minimum expected project completion time and identify which activities are on the critical path. (4 marks) iii. Explain why the critical path is the longest, not the shortest, path through a network