Additional Problem $17-1($Algo$)$

A city hall plans on holding a townhall event at the end of the Fall. The activities that have to be completed, duration of each activity, and their sequence are listed in the table below:

$\backslash$table$[[$Activity$,\backslash$table$[[$Duration$],[($weeks$)]],\backslash$table$[[$Immediate$],[$Predecessor$]]],[$A$,2,--],[$B$,3,$A$],[$C$,3,$A$],[$D$,1,$B$],[$E$,4,$D$,$ C$],[$F$,1,$E$]]$

a$.$ Determine the project duration.

The longest path is ABDEF$=$ weeks

b$.$ What is the earliest start, earliest finish time, latest start, latest finish time for activity E$?$