Given the following project: Normal Cost Activity Normal Time (day) Predecessor Crash Time (day) Crash Cost ($) ($) A 5 5 40 40 30 B 5 30 5 10 C 5 70 A B D 7 40 40 30 2 60 E 6 50 N F 11 60 5 90 G 6 30 4 C,D C,D E,F G 60 32 . 5 20 1 - 4 20 4 20 Note: A,B and I not crashable. (a) (9 Points) Draw the network and find the critical path duration of the project, total cost of project using normal times. (b) (4 Points) 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 D E F G H - Kc) (9 Points) Calculate the cost of the project at each iteration (or step) until you can no longer crash the project any further. Continue crashing until you can't crash any more. Project Duration (day) Total Direct Costs Normal duration 1st iteration 2nd iteration 3rd iteration 4th iteration 5th iteration (d) (8 Points) Assume each day the project incurs an indirect cost of 78. Based on the calculations you made on part (c), what would be the optimal duration with lowest cost including the indirect costs. Project Duration (copy from part (c)) Total Direct Costs (copy from part (c)) Indirect costs TOTAL COST Normal duration 1st iteration 2nd iteration 3rd iteration 4th iteration 5th iteration