1. The project costs are $1000 per day. The project manager has supplied the cost and crashing time information as follows: Activity Activity Times Immediate Crashing Predecessor(s) Potential Cost per Day to Crash (days) A 6 5 $1100 B 10 A 3 $500 C 5 1 $300 D 3 $700 E D 3 $600 F 3 B, E 2 $800 (a) Draw the network diagram of the project. (2.5 points) (b) What is the minimum number of days to complete this project? Calculate the slack time of each activity and identify which activities are critical and which are not. (2.5 points) (c) Suppose the project manager hires you and requests the project duration to be cut to 14 days. What is the least costly way to achieve manager's goal? Please list the sequence of activities to be crashed and report the final total project cost (that is, weekly project costs + costs from crashing). (4.5 points) (d) Is there any other way to realize this project at a lower total cost than you found in part (c)? If so, what is the maximum amount of money you can save (compared to the total project cost you found in part (c)) by proposing a new project duration and sequence of activities to be crashed? Explain. (3.5 points) Hint: The answer is hidden in your solution for part (c). Question I ES EF LS LE 616 0,6 A, 6 B, 10 18,21 O 2,8 8,18 F3 0,5 5,9 C,5 918 18,21 D, 4 0,5 E, 9 18 A, B, F-19 C, D, E F-21 5,9 ES EF | LS LF / stack fime Activity A 0 6 2 8 2 Critical? No B 6 16 8 18 2 NO C 0 5 0 5 0 Yes DEF 5 9 5 9 0 Yes 9 18 9 18 Yes F|18 21 18 21 0 Yes