Activity Preceding Activity Normal Completion Time (week) Crashed Completion time (week) Crashed Cost per week A - 8 B A 7 7 5 $600 $700 A 6 6 --- D B 9 8 $800 E B, C 5 4 $400 F D 9 8 $500 G E 10 8 $700 i. ii. iii. iv. V. Draw the network diagram linking all the activities in a way that it shows if there exist any preceding activity/activities before starting each of the mentioned activities in the above table. Mark: 2 Find the earliest start time, the earliest finish time, the latest start time and the latest finish time of each of the activities in the project and hence the completion time of the project and the critical path. Mark: 5 Find the slack time (delay time) of each of the activities, the critical and the non-critical activities. Mark: 2 Find the minimum possible completion time of the project by considering the crashed completion times and the minimal total cost of that crashing the project. Mark: 4 Highlight the critical and non-critical activities of the finally completed project by taking into account the crashed times of activities. Mark: 2