letter E!

letter e!

\begin{tabular}{ccc} \hline Activity & Duration (days) & Predecessors \\ \hline A & 6 & None \\ B & 14 & A \\ C & 14 & A \\ D & 10 & A \\ E & 26 & A \\ F & 34 & B \\ G & 8 & C \\ H & 11 & C \\ I & 18 & D, E \\ J & 6 & E \\ K & 13 & E \\ L & 6 & F, G, H \\ M & 11 & I, J, K \\ N & 15 & L, M \\ \hline \end{tabular} a. Choose the correct network diagram below. b. Idenlify all the paths through the network and their lengths. Fill in the table below (entor your responses os voole numbers). e. The critical activities are A,E,I,M, and N, so they make up the critical path. The entire project will take days to complete. (Enter your response as a whote number.) d. Aftor you completed part b and before you performed the forward and backward passes, you could already tell that activities A and N are on th A. The durations of these activitios are the largest. B. Activity N has only two predecessors. C. Delay in theso activites will not cause the entire project to be late. D. They are always the start and end activitios. e. After constructing the project network diagram, management comes up with the following information regarding how many days certain aciwites every day the project goes on costs the company $7,000. How many days should management crash the project? What activities should it crash? Fiti Cick the loon to wiw the number of dirys certain actvitee cas be crashed and tar cout Identify all the paths through the network and their lengths. Fill in the lable below (enter your responses as whole numbero). c. The critical activities are A, E, I, M, and NT, so thay make up the critical path. The entire project will take 76 days to complete. (Enter your rosponse as a whote mumbery \begin{tabular}{ccc} Activity & NumberofDaysActivityCanBeCrashed & CrashCostperDay \\ \hline B & 2 & $8,500 \\ C & 3 & $4,500 \\ D & 3 & $5,500 \\ E & 3 & $2,500 \\ F & 2 & $4,000 \\ I & 1 & $3,000 \\ \hline \end{tabular}