Assume the network and data that follow ACTIVITY B IMMEDIATE PREDECESSORS NORMAL TIME NORMAL (WEEKS) COST 2 $ 50 4 80 8 70 6 60 100 4 40 5 100 CRASH TIME (WEEKS) 1 2 4 5 6 3 4 CRASH COST $ 70 160 110 80 130 109 150 D E No wa A A B D C, E, F G c. Demonstrate the crashing steps needed to minimize the cost of crashing down to various project lengths Consider project lengths of 18, 17.16.15.14 and 13 weeks. For each possible step down in project length, specify which activity would be crashed to achieve that length, compute the resultant length of each path in the project, and compute the crashing costs as shown in the table below (Leave no cells blank.be certain to enter "0" wherever required.) 18 Weeks 17 Weeks 16 Weeks 15 Weeks 14 Weeks 13 Weeks Project Duration: Length of path ABEG Length of path ACG Length of path ADFG Activity Crashed Crash cost for this step Cumulative crash coot Total direct cost