Activity	Preceding Activity	Normal Completion Time (week)	Crashed Completion time (week)	Crashed Cost per week
A	-	5	4	500
B	A	7	7	700
C	A	6	4	600
D	B,C,E	9	8	800
E	B	6	4	400
F	D,E	10	8	500
G	D	9	8	900

i. 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 ii. Find the completion time of the project and the critical path. Mark: 3 iii. Find the slack time (delay time) of each of the activities, the critical and the non-critical activities. Mark: 4 iv. 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 v. Highlight the critical and non-critical activities of the finally completed project by taking into account the crashed times of activities. Mark: 2