Problem $3$ : CPM$/$PERT

Using CPMVPERT 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.

$\backslash$table$[[$Activity$,$Predecessor,Duration$($Most Likely$)],[$A$,-,13$ days$],[$B$,=8,8$ days$],[$C$,$A$,14$ days$],[D,,1$ Week$],[E,C,\frac{D}{\frac{?}{?}}f,4$ days$],[$F$,E,1$ Week$],[$G$,$E$,2$ days$],[$H$,F,6$ Days$],[$I$,$D$,1$ Week$],[J,A,B,2$ Weeks$]]$

Each week consisis of