(1) You are given the following project data: Activity Crash Preceding Current (days) Crash Current Activity Time Time Cost Cost 13 12 14 20 12 16 13 16 C-I77/00> None None None A B.D B.D A E.F H 4826868284 BR686587H4 8,000 10,000 5,000 12,000 14,000 3,000 17,000 11,000 13,000 16,000 9,200 16,400 11,000 14,700 29,600 7,000 19,400 21,500 20,000 27,000 15 36 33 18 11 14 (a) Using the Activity on Node approach draw the network indicating clearly the earliest and latest start times, earliest and latest finishing times for each activity and the critical path of the network. (18 marks) (b) Determine the current completion time and the current cost. (4 marks) (c) Determine the daily reduction cost and the float for each activity. (4 marks) (d) By crashing certain activities in the above project determine the minimum completion time and its associated minimum cost. (24 marks) (iii) Draw the Activity on Node network for the following project with time lag dependencies indicating clearly the earliest and latest start times, earliest and latest finishing times for each activity. Also state the critical path and project duration of the network. Activity B D E Time(weeks) Precedence Rules 3 none 2 Starts after A has finished 6 Starts at least one week after D has finished 4 Starts at least one week after A has started 3 Starts after C has finished, and at least two weeks after F has finished and finishes after B finishes 3 Starts at least one week after D starts and finishes at least one week after D has finished (14 marks) (Total 80 marks) F