(5,9) 5 (26) 6 (78) (8,9) 6 (4,7) a. Construct the project network for this project b. Find the earliest time. latest time and slack for each event as well as the slack for each activity. Also identify the critical path c. If the precedence relationship implied by dummy activity(4, 7)could be removed by how much would the project completion time be reduced? Solution:(a) The project network is 0|0 50 150 201 15 21 )i+5-G 6 (b) The earliest time, latest time, and slack for each event is described in the above graph, the critical path is 1→2→3→4→7→8→9 (c)If the precedence relationship implied by dummy activity (4, 7) could be removed the earliest time, latest time, and slack for each event is changed, they are described in the following graph. We can see, one minutes can be reduced 150 100 15 6 2 13|17 (5,9) (2,6) (6,7) (7,8) (8,9) (4,7) 5 6 2 5 6 0 a. Construct the project network for this project. b. Find the earliest time, latest time , and slack for each event as well as the slack for each activity. Also identify the critical path. c. If the precedence relationship implied by dummy activity (4,7) could be removed, by how much would the project completion time be reduced? Solution: (a) The project network is (b) The earliest time, latest time , and slack for each event is described in the above graph, the critical path is 1→2→3→4→7→8→9. (c) If the precedence relationship implied by dummy activity (4,7) could be removed, the earliest time, latest time , and slack for each event is changed, they are described in the following graph. We can see, one minutes can be reduced. 1 2 3 4 5 9 6 7 8 5 5 5 5 5 6 2 0 5 6 0 0 0 5 5 0 10 10 0 15 15 0 20 21 1 26 26 0 20 20 15 0 15 11 0 13 14 1 2 3 4 5 9 6 7 8 5 5 5 5 5 6 2 5 6 0 0 0 5 5 0 10 10 0 15 15 0 20 20 0 25 25 0 18 19 13 1 14 11 1 12 1