1. prepare a Precedence Diagram,

2. calculate the duration for each path,

3. identify the critical path,

4. calculate and identify the ES, EF, LS, and LF for each task, and

5. calculate and identify the slack time for each task, for the following project:

Project tasks

• There are ten total tasks, named AJ.

• Tasks A, B, and H have durations of two days.

• Tasks C, E, I, and J have durations of three days.

• Tasks D, F, and G have durations of one day.

• Tasks A, C, D and F have no dependencies.

• Task B cannot start until task C has finished.

• Tasks A and F must finish before Task E can start.

• Task E must finish before Task G starts.

• Task H cannot start until Task B has finished, and Task D must finish before Task I starts.

• Tasks G, H, and I must finish before Task J can start.