A network consists of the following list. The list of the activities and their times (in hours) and precedence relationships are given below.

Draw the project network graph by using an Activity-on-Node (AON) representation. Then calculate the Earliest Start, Earliest Finish, Latest Start, Latest Finish and Slack times and determine the set of activities that form the Critical Path.

Activity	Normal Duration (hours)	Crash Duration (hours)	Normal Cost ($)	Crash Cost (S)	Immediate Predecessors
A	2	2	10	-	None
B	3	2	15	23	A
C	5	4	25	30	B
D	3	1	20	24	C
E	6	4	30	45	C
F	1	1	5	-	C,E
G	7	6	35	50	F
H	10	7	50	62	D,G

Please answer the following questions. (hint, the latest finish of Activity E is 16).

1. The Project completion time is hours.

2. For Activity B, the Earliest Start is , the Earliest Finish is .

3. For Activity C, the Latest Start is , the Latest Finish is .

4. For Activity E, the Earliest Start is , the Earliest Finish is .

5. For Activity G, the Latest Start is , the Latest Finish is .

6. For Activity H, the Earliest Start is , the Earliest Finish is

7. What is the critical path? (please write down the letters only. For example, if you think the critical path is "start->A->B->C->end", please write drown "ABC", no space between letters).

_____________

8. Suppose you need to crash the project. The activity that will be crashed first is Activity __________.