QUESTION 1 Consider a project with the activities durations and precedence relations depicted in the table below Activity Immediate Predecessor Duration, weeks A 3 A 4 C A 2 D 6 B, C IE 5 3 7 G E IH 5 E, F D, G, H 8 Draw the network diagram and attach it here. Attach File Browse My Computer Browse Content Collection QUESTION 2 Find the early start time (EST), early completion time (ECT), late completion time (LCT), early completion time (ECT) and slack of each activity. Plug only the resulting numbers into the following table. Pay attention to the column names! Activity Immediate Duration EST ECT LCT LST Slack Predecessor A 3 B A 4 A 2 ID B, C 6 5 OL F 3 G E 7 H E, F 5 1 D, G, H 8 QUESTION 3 c. What is(are) the current critical path(s)? A-B-E-G-I A-C-E-G-I and A-C-E-H-1 A-C-D-1 A-C-E-G-1 A-C-F-H-1 QUESTION 4 d. Assume that all activity times are certain. We can crash any of the activities A, E, H and I by 1 week (i.e., reduce the activity time by one week). The costs of doing it are $10k for activity A, $15k for activity E, $5k for activity H and $20k for activity I. If we want to reduce the project duration by 1 week, which activity we should crash? A E H Any activity on the critical path QUESTION 5 e. By how much we can reduce the duration of the activity G without introducing any new critical paths? by 1 week (that is, new time will be 6 weeks) by 2 weeks (that is, new time will be 5 week) by 3 weeks (that is, new time will be 4 weeks) We cannot reduce G without introducing new critical paths