Identify all the paths through the network and their lengths. Fill in the table below $($enter your responses rounded to one decimal$$ place$).$

Part $4$Part $5$Part $6$Part $7$

Path

Length$($days$)$

$$A$-$C$-$

E$-$G

$$

enter your response here

$$A$-$

D

$-$E$-$G

$$

enter your response here

$$A$-$

D$-$F

$-$G

$$

enter your response here

B$-$D

$-$E$-$G

$$

enter your response here

$$B$-$

D$-$F

$-$G

$$

enter your response here

Part $8$

c$.$ The critical activities are

A$,$ C$,$ E$,$ and G

so they make up the critical path.

Part $9$

The entire project will take

$$

enter your response here days to complete. $($Enter your response rounded to one decimal place.$)$

Part $10$

d$.$ Management would like to complete the project in less than $13$ days. Management has determined that activity Upper E can be crashed $6$days$,$ for a total cost of $$$$7$ comma $500.$ No other activities can be crashed.

After$$ crashing,

A$,$ C$,$ E$,$ and G

is the critical path. The entire project will take

$$

enter your response here days. $($Enter your response rounded to one decimal$$ place.$)$

Part $11$

Crashing activity Upper E

$$

meet$$ management's goal of less than $13$ days.