Problem \#5-AoN Diagram - Complex Activity Relationships (20 points) Given the activity-on-node diagram shown below, do the following: a. Compute the scheduling information (ES, EF, LS, LF, and TF), and include the information in the diagram. (15 points) b. Identify the critical path. ( 5 points) * Assume the first activity starts at day 0. Activity D and E have a start-to-start (SS) with lag of 1, Activity F and H have start-tofinish (SF) with lag of 7 , and Activity I and K have a finish-to-finish (FF) with lag of 2