Given the schedule of a project activities below, answer the following questions:

$1.$ Draw the Network Diagram: List all the activities and represent them with arrows or nodes that show the sequence and dependencies.

$2.$ Calculate the Earliest Start $($ES$)$ and Earliest Finish $($EF$)$: For each activity, calculate the earliest start time and earliest finish time, beginning with the start of the project and moving forward through the network diagram.

$3.$ Calculate the Latest Start $($LS$)$ and Latest Finish $($LF$)$: For each activity, calculate the latest start time and latest finish time, starting with the project's end date and moving backward through the network diagram.

$4.$ Identify the Critical Path and determine the project duration: The critical path is the longest path through the network diagram with the least amount of slack or float time. Activities on this path cannot be delayed without delaying the project.