Use the three$-$step process below, calculate a schedule with ES$,$ EF$,$ LS$,$ LF dates for project network diagram shown below, as well as identify critical path and its length.

$1.$ Forward pass: determine ES$,$ EF

$2.$ Backward pass: determine LS$,$ LF

$3.$ Calculate float$/$slack $\backslash$& identify critical path

$-$ Float $\backslash (=\backslash )$ LS $-$ ES

Assumptions

$-$ The ES date of the first task is on the first day of the project

Legend

$-$ The duration of tasks is counted in days.

$-$ The start of a day is assumed to be $8$ a$.$m$.$ and the finish is $5$ p$.$m$.$

$-$ The project finish date is the EF of the last taskext

Note: The boxes in the figure below are fillable. You can type in your answers directly.

The critical path is $($list tasks on the critical path$)$: $\backslash (\backslash$qquad $\backslash )$ ; length of the critical path is $\backslash (\backslash$qquad $\backslash )$ days.