In a project, it was identified that the following activities and predecessors are necessary. The expected time is estimated according to the optimistic time, most likely time and pessimistic time for each activity. The crash time in the following table is the maximum crashable time if the company could spend more money to achieve faster times. Max Cost Activity Predecessor Expected time Variance crashable (normal, time crash) a - 10 1.8 1 20, 80 b a 1 0.1 0 C a 21 5.4 4 35, 70 d b 5 0.4 2 30, 60 e d 3 0.1 1 20, 120 f C 10 1.0 2 30, 60 g d h g i c.g 2223 0.1 1 35, 70 0.4 0 0.0 0 0.1 1 20, 120 k h 1 0.1 0 T j.k 2 0.1 1 20, 100 1. Draw a logic network for the project and identify the critical Path, Slack times for each activity. 2. Identify the critical path and total time for the project if the activities 'c' and 'd' can be crashed to the maximum crushable time. Clarify whether the critical path has been changed after crashing and how much minimum extra cost will be for delivering the project after taking the maximum crushable time in activities 'c' and 'd'?