(a) Draw the project network. Use activity on node (A-O-N) method. (b) 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) 37 days, (ii) 40 days? [3+1+2+1+5=12] (a) Draw the project network. Use activity on node (A-O-N) method. (b) 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) 37 days, (ii) 40 days? [3+1+2+1+5=12] (a) Draw the project network. Use activity on node (A-O-N) method. (b) 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