their predecessors and their optimistic, most likely, and pessimistic duration.

Develop the network for this project;

Show the deterministic critical path or paths;

Calculate the probability of finishing the project in $28$ days;

Calculate the probability of finishing the project on day $35.$

$\backslash$table$[[$Activity$,$Predecessor,Duration$],[$Optimistic$,$Likely,Pessimistic$],[$A$,-,2,4,6],[$B$,$A$,5,7,9],[$C$,$A$,3,4,5],[$D$,$A$,2,4,6],[$E$,$B$,$ C$,1,5,9],[$F$,$C$,$ D$,3,6,9],[$G$,$B$,5,8,11],[$H$,$G$,4,7,10],[$I$,$H$,$ F$,3,6,9]]$

The following network table represents the activities involved in a project along with their predecessors and their optimistic, most likely, and pessimistic duration.

Develop the network for this project;

Show the deterministic critical path or paths;

Calculate the probability of finishing the project in $28$ days;

Calculate the probability of finishing the project on day $35.$

$\backslash$table$[[$Activity$,$Predecessor,Duration$],[$Optimistic$,$Likely,Pessimistic$],[$A$,-,2,4,6],[$B$,$A$,5,7,9],[$C$,$A$,3,4,5],[$D$,$A$,2,4,6],[$E$,$B$,$ C$,1,5,9],[$F$,$C$,$ D$,3,6,9],[$G$,$B$,5,8,11],[$H$,$G$,4,7,10],[$I$,$H$,$ F$,3,6,9]]$