Question 3 (12 points) 10 A project has been defined to contain the following list of activities, along with their precedence relations and three time estimates for the activity durations. (Durations are expressed in number of weeks.) Some statistical estimates have also been computed in the last two columns on the right. most Task Predecessor optimistic likely pessimistic exp v ar stdev 14 10.33333 1 BA 11 8.333333 0.444444 0.666667 32 D A 54. 50.25 0.5 E B 10 6.333333 1 1 14 9.333333 1.777778 1.333333 10 7.166667 0.694444 0.833333 a. Use the most likely task durations to determine the critical path(s). (You may want to draw the activity-on- nodes diagram on a piece of paper to help you with the calculations. You may also want to derive a list of all the paths through the network.) Enter your path(s) in one of the following formats: A-B-C-D or A,B,C,D. IF there are several critical paths, separate them by a semicolon (:') A b) Compute the slack on activity D. b) Compute the expected duration for activity C c) Compute the variance for activity C. Find the probability that the critical path takes longer than 35 weeks. (If there are multiple critical paths. arbitrarily pick one of them.) Find the probability that the second longest path takes more than 35 weeks