Problem $4$ : CPM$/$PERT

$\backslash$table$[[$Activity$,$Predecessor,Duration$($Most Likely$)],[$A$,,13$ days$],[$B$,,8$ days$],[$C$,$A$,14$ days$],[$D$,,2$ Week$],[$E$,$C$,$D$,4$ days$],[$F$,$E$,1$ Week$],[$G$,$E$,44$ays$],[$H$,$F$,6$ Days$],[$I$,$D$,1$ day$],[$J$,$A$,$B$,1$ Week$]]$

Using CPM$/$PERT find the minimum number of days to finish the project. For each activity find out the earliest start and finish time as well as latest start and finish time.

Each week consists of $5$ days