In the given netwоrk diаgrаm tо determine slаck in a prоject, A=3 indicates that activity A takes 3 days to complete. Perform a forward pass through the given network diagram to calculate the earliest time an activity can start and finish, based on the project's start date. Start with the first activity (activities with no predecessors) and set the Earliest Start (ES) to 0. Add the duration of the activity to its ES to get the Earliest Finish (EF): EF = ES + Duration Move to the next activities that depend on the completed activity and calculate their Earliest Start. For activities with multiple predecessors, the ES is the largest EF of all its predecessor activities. Continue this process through the entire network until you calculate the EF for the final activity. Perform a Backward Pass through the given network diagram to calculate the latest time an activity can start and finish without delaying the project. Start with the final activity and set the Latest Finish (LF) equal to its Earliest Finish (EF), as the project must finish at this time. Subtract the activity's duration from its LF to get the Latest Start (LS): LS = LF − Duration Move to the previous activities and calculate their Latest Finish. For activities with multiple successors, the LF is the smallest LS of all its successor activities. Continue this process until you calculate the LS for the first activity. Based on these two passes, you can find the values of the labels in the network diagram. The labels, in order, are the early start, early finish, late start, and late finish times of each activity. What is Early Start day for activity F, f0 = _______ What is Early Finish day for activity F, f1 = _______ What is Late Start day for activity F, f2 = _______ What is Late Finish day for activity F, f3 = _______ What is Total Slack in activity F (in days) = _______