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

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.

ii. Showing 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 determine the completion time of the

project and the critical path.

iii. Find the slack time (delay time) of each of the activities, the critical and the non-critical

activities.

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.

v. Highlight the critical and non-critical activities of the finally completed project by taking into

account the crashed times of activities.

PLEASE PROVIDE HANDWRITTEN SOLUTION.