For the following simple seven-activity project, develop a precedence network, calculate all relevant characteristics of each activity (ES, EF, LS, LF, TF), and the project duration. Then go through a repetitive process to expedite the project on a least-cost basis until the project is crashed. The solution should include the precedence diagram and calculations for each activity, and then the cyclical calculation to shorten the project activity by activity in a least-cost manner. What isthe total cost of the crashed project? Why is this less than the sum of the crashed costs for the seven activities?

Activity	Relationships	Normal Duration	Crash Duration	Normal Cost	Crash Cost
A		3	2	$$ 3,000$	$$ 3,150$
B	A: FS	4	3	$$ 4,000$	$$ 4,250$
C	B: FS	3	1	$$ 6,500$	$$ 7,000$
D	A: FS	4	2	$$ 6,000$	$$ 6,500$
E	D: FS	4	2	$$ 3,500$	$$ 3,900$
F	A: FS	5	2	$$ 2,200$	$$ 2,725$
G	C, E, F: FS	6	4	$$ 3,900$	$$ 5,000$