Assume the network and data that follow:

ACTIVITY NORMAL TIME $($WEEKS$)$ NORMAL COST CRASH TIME $($WEEKS$)$ CRASH COST IMMEDIATE PREDECESSORS

A $2$ $$501$ $$70$

B $4802160$ A

C $8704110$ A

D $660580$ A

E $71006130$ B

F $4403100$ D

G $51004150$ C$,$ E$,$ F

b$.$ Indicate the critical path when normal activity times are used.

multiple choice $1$

A$-$B$-$E$-$G

A$-$D$-$E$-$G

A$-$C$-$F$-$G

A$-$D$-$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.