Assume the network and data that follow: IMMEDIATE PREDECESSORS ACTIVITY DORO NORMAL TIME NORMAL CRASH TIME (WEEKS) COST (WEEKS) 2 $ 50 4 80 70 6 60 7 100 40 100 CRASH COST $ 70 160 110 80 130 100 150 E A B D C, E, E G b. Indicate the critical path when normal activity times are used. OA-D-F.G O A-D-E-G O A-B-E-G O A-C-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 "o" wherever required.) 18 Week 17 Weeks 16 Weeks 15 Weeks 14 Weeks 13 Weeks Project Duration: Length of path ABEC Length of path ACG Length of path ADFG Activity crashed Crash cost for this step Cumulative crash cost Total direct cost