Given the following project: Activity Predecessor Normal Time (day) Normal Cost ($) Crash Time Crash Cost (day) ($) 10 10 5000 A B 5000 1200 12 11 1300 C A,B 11 3600 9 D 5 4 300 1000 E 8 6 4800 600 2000 5400 1000 F 9 2400 7 G D,E,F 700 7 (a) Draw the network and find The critical path Duration of the project, total cost of project using normal times. (b) Calculate the maximum time reduction and crash cost-per-day (all activities may be partially crashed) for each activity. Then fill the table below. Activity Maximum Time Reduction (day) Cost to Crash per Period ($/day) A B C D E F G (c) Calculate the cost of the project at all time durations (decrease total duration by one day on each iteration) until you can no longer crash the project any further. Project Duration (day) Total Direct Costs Normal duration Normal duration - 1 day Normal duration -2 day Normal duration -3 day Normal duration -4 day Normal duration - 5 day Normal duration -6 day