2. The following table lists the activities of a network along with their time estimates: Activity Predecessor Duration (Days) Optimistic (a) Most Likely (m) Pessimistic (b) A None 2 5 8 B None 4 7 16 C A 3 6 9 D A 2 5 8 E C 5 8 11 F D 3 6 15 G B 2 5 14 H E, F 2 5 8 I G 6 9 12 J H, I 0 0 0 (a) Draw the project network. Use activity on node (A-O-N) method. (b) Identify the Critical Path. Calculate the length and variance of the Critical Path. (c) Identify the non-critical activities. Work out the Total Slack (TS) and Free Slack (FS) for all the non-critical activities. (d) State whether the network is sensitive or insensitive! (e) What is the approximate probability that jobs on the critical path will be completed by the due date of (i)24 days, (ii) 29 days