The network below represents a project being analyzed by Critical Path Methods. Activity durations are A=5, B=2, C=12, D=3, E=5, F=1, G=7, H=2, I=10, and J=6.

a. What task must be on the critical path, regardless of activity durations?

b. What is the duration of path A-B-E-H-J?

c. What is the critical path of this network?

d. What is the length of the critical path?

e. What is slack time at activity H?

f. What is the Late Finish of activity H?

g. If activity C were delayed by two time units, what would happen to the project duration?

The following table provides the information necessary to construct a project network and project crash data.

		Activity Time (weeks)		Activity Cost ($)
Activity	Activity Predecessor	Normal	Crash	Normal	Crash
A	--	16	8	2000	4400
B	--	14	9	1000	1800
C	A	8	6	500	700
D	A	5	4	600	1300
E	B	4	2	1500	3000
F	B	6	4	800	1600
G	C	10	7	3000	4500
H	D, E	15	10	5000	8000

Construct the project network, and crash the network the maximum amount possible.