1. Determining Critical Path and Activity Slack (2 pts.) Assume we have a set of activities, their expected durations, and immediate predecessors. Construct an activity network; identify the critical path and all activity slack times. Activity Duration Predecessors Free Slack Total Slack A B 6 7 5 3 4 A D E F B D, E F. G 5 8 3 G H A) Critical Path (A-B-D-G-H) Free Slack (C = 0d, E = 10, F = 8d) Total Slack (C = 10, E = 10, F = 8d) B) Critical Path (A -B-D-G) Free Slack (C = 0d, E = 1d, F = 8d, H = 0d) Total Slack (C = 10, E = 1d, F = 8d, H=1d) c) Critical Path (C-E-F) Free Slack (C = 0d, E = 1d, F = 8d) Total Slack (C = 10, E = 1d, F = 8d) D) Critical Path (A-B-C-D-G-H) Free Slack (C = 0d, E = 10, F = 60) Total Slack (C = 10, E = 1d, F = 6d)