Consider a project with the activities durations and precedence relations depicted in the table below

1 Draw the network diagram

2 What is(are) the current critical path(s)?

3 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?

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

Activity	Immediate Predecessor	Duration, weeks
A	-	3
B	A	4
C	A	2
D	B, C	6
E	C	5
F	C	3
G	E	7
H	E, F	5
I	D, G, H	8