Can you please answer the question below. Please make sure the answer is readable before you upload it.

Question 3. (30 points) Given the following project: Activity Predecessor Normal Time (day) Normal Cost (S) 5000 Crash Cost ($) Crash Time (day) 10 11 A 10 B 12 11 1200 3600 5000 1300 4800 C AB 9 D C 5 300 4 600 2000 E C 8 1000 6 2400 5400 7 7 700 1000 F C 9 G D,E,F 8 (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 (0) (9 Points) 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 (d) (8 Points) Based on the calculations you made on part (c), estimate the optimal duration with lowest cost by including the indirect costs. Project Duration (copy from part (c)) Total Direct Costs (copy from part (c)) Indirect costs TOTAL COST 3000 Normal Duration -1 -2 -3 -4 -5 -6 2500 2000 1500 1000 500 250