Problem 3- Using the computing algorithm, determine the shack times for the following AOA diagram. Identify the activities on the critical path. 1. Perform a forward pass: Calculate the earliest start time (EST) and earliest finish time (EFI) for each activity in the network. a. Begin at the start node, with an EST of 0 . b. Move forward through the network, calculating the EST and EFT for each activity by adding its duration to the EFT of its Immediate predecessor. c. If an activity has multiple predecessors, choose the largest EFT among them as the EST for that activity. 2. Perform a backward pass: Calculate the latest start time (LST) and latest finish time (LFI) for each activity in the network. a. Begin at the end node, with an LFT equal to the EFT of the project (i.e., the EFT of the last activity in the network). b. Move backward through the network, calculating the LST and LFT for each activity by subtracting its duration from the LST of its immediate successor. c. If an activity has multiple successors, choose the smallest LST among them as the LPT for that activity