Suppose that you have to schedule and coordinate the various activities for an accounting project. The project can be subdivided into the following ten activities. Immediate Expected Activity Predecessor Time {days} 5 1"l You can see the project network below. After detailed analysis of the project, you found the expected activityr times (in days) for all ten activities. These numbers are incorporated into the project network. Use the given information to answer to the fol owing questions. Start Finish (a) Fill in the activity nodes. (b) The critical path is [ Select an answer \\). If you get more than one critical path, please select the upper one. For example, if you have A-C-G-J and B-H-I-J, then you have to select A-C-G-J. (c) The expected optimal completion time is E(t) = days. (d) Based on the results for the questions (a)-(b), answer the following questions: How many days the activity D can be delayed without increasing the expected project completion time? Is it possible that the activity B is delayed without increasing the expected project completion time? Select an answer V (e) The following table shows the calculated expected variance for each activity. Expected Activity Variance 02 A 0.61 B 0.57 C 0.7 D 0.22 E 1.07 F 1.22 G 1.05 H 0.28 0.41 0.43 Based on the result for question (b) and the table above, calculate the expected standard deviation for the project completion time. Round the result to 2 decimal places. o (T ) = days (f) Assume that the project completion times are normally distributed with u = E(t) (see question (c)) and a = o(T) (see question (d)). Note: If the z-score is less than - 3.49 , then assume that the probability is equal to zero. For example, P(z 4.06) = 1. Note: Do not convert probabilities to percent. What is the probability that the project will be completed in . 39 days? P(T