QUESTION THREE

$[25]$

The information relating to a project that you are working on is listed in the table below:

$\backslash$table$[[$Activity$,$Predecessor,$\backslash$table$[[$Optimistic$],[$Time$],[($Days$)]],\backslash$table$[[$Most likely$],[$Time$],[($Days$)]],\backslash$table$[[$Pessimistic$],[$Time$],[($Days$)]]],[$A$,-,4,8,24],[$B$,-,3,10,11],[$C$,-,6,12,24],[$D$,$A;B$,9,14,25],[$E$,$B;C$,11,16,27],[$G$,$F$,5,9,15]]$

Required:

$3\mathrm{.}1$ Using the PERT formula calculate the time value $($t$)$ for each activity and construct the network diagram $($Activity on Node$).$

$3\mathrm{.}2$ Calculate the Early Start; Late Start; Early Finish & Late Finish and slack times for all activities.

$(10)$

$3\mathrm{.}3$ Identify the paths and show critical path.

$(5)$