The following table lists the activities of a network along with their time estimates: Activity Predecessor (b) ABCDEFGHIY None None A ACDBEG E, F H, I Optimistic (a) 3277WUNA 33 4 5 0 Duration (Days) Most Likely (m) 69751655 11 10 0 Pessimistic 15 27 16 8 17 15 14 54994 19 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) 35 days, (ii) 41 days? (0.50+0.50+0.50+0.50+3.00=5)