Activity	Predecessor	Duration (in Weeks)
A	N/A	3
B	A	4
C	A	6
D	B, C	5

1. Draw the Gantt chart.
2. Draw the network diagram.
3. List all paths and their associate total time. Example: A -> . -> D = weeks.
4. Define the critical path using your own words.
5. Which path is the critical path?
6. What is the estimated completion time to finish this project?
7. Assume that the required completion time (target) is like your answer in part (f). For each activity, calculate the earliest start time (ES), earliest finish time (EF), latest start time (LS), latest finish time (LF), and total slack (TS). Put ES, etc. on the network diagram.