Answered
Consider the network described in the table below.
Activity Immediate Predecessor(s) Pessimistic Probable Optimistic J −−15108 K −−987 L J 1065 M J 333 N K, M 951 O K, M 1074 P L, N 1083\begin{array} { | c | c | c | c | c | } \hline \text { Activity } & \begin{array} { c } \text { Immediate } \\\text { Predecessor(s) }\end{array} & \text { Pessimistic } & \text { Probable } & \text { Optimistic } \\\hline \text { J } & - - & 15 & 10 & 8 \\\hline \text { K } & - - & 9 & 8 & 7 \\\hline \text { L } & \text { J } & 10 & 6 & 5 \\\hline \text { M } & \text { J } & 3 & 3 & 3 \\\hline \text { N } & \text { K, M } & 9 & 5 & 1 \\\hline \text { O } & \text { K, M } & 10 & 7 & 4 \\\hline \text { P } & \text { L, N } & 10 & 8 & 3 \\\hline\end{array} Activity J K L M N O P Immediate Predecessor(s) −−−− J J K, M K, M L, N Pessimistic 15910391010 Probable 10863578 Optimistic 8753143 a. Calculate the expected duration of each activity.
b. Calculate the expected duration and variance of the critical path.
c. Calculate the probability that the project will be completed in fewer than 30 time units.
On Sep 23, 2024