Is this correct?

a) Fill in the table with each path and show your work by calculating the time for each path in the table to determine the critical (longest) path(s). Add/ delete rows in the table as needed. Path Time ACEG ADEG ADFG BDFG B DEG (2+5+2 + 2) = Il days (2+10+ 2+2) = 1 days (2 + 10 +3+2) = 17 days (7+10 +3+2) = 22 days CRITICAL (7+ 10 + 2+2) 21 days b) Fill in the ES & EF times in the table below working from Start to Finish. Then, fill in the LS & LF times working backwards from Finish to Start, After determining the ES, EF, LS, & LF times, calculate the Slack time for each activity using both SlackLS- ES and Slack-LF-EF. Note: Both calculations must give you the same answers. ES LS EF Activity Slack 2-00 A 2 2 2-0 =0 7-00 B 7 7 7-O:D LF O o 7 7 7 2. o 2 2 7 JI 17 D 12 . 5 17-25 19-12-5 5 (3D 19-9-10 10 12.5 20-15=3 5 E 9 19 17 17 20 15 J. F 12 43. You are given the activity information below and the activity-co-code procedence diagram for a project at your company, 16 points (-4/error) a) Determine the critical path and its duration. What is your initial estimate for project completion time? Show your work on the next page. b) Fill in the table on the next page to determine the earliest start (ES) time, the carliest finish (EF) time, the latest start (LS) time, the latest finish (LF) time, and the Slack for each project activity. Slack-LS-ES or LF-EF Activity Time (daya) Immediate Predecessors) A 2 7 5 D AB 10 E CD 2 F D G EF 2 Start G Finish B D E Note: This precedence diagram is posted as a separate pdf also. Continued on next page G " 6 9 CHOCK CDb