A Project Consists of Eleven Activities (All Times Are Given

Multiple Choice

A project consists of eleven activities (all times are given in days) and has worker requirements as indicated in the table.Assume that all four workers employed by this organization are generalists and are able to work on any of the tasks.What is the fastest the project can be completed while constrained by the four worker limitation? $$\begin{array} { | l | l | l | l | } \hline \text { Activity } & \text { Activity time } & \text { Workers Needed } & \text { Predecessor } \\\hline \text { A } & 10 & 1 & \\\hline \mathrm { B } & 4 & 2 & \\\hline \mathrm { C } & 7 & 3 & \mathrm {~A} \\\hline \mathrm { D } & 4 & 1 & \mathrm {~A} \\\hline \mathrm { E } & 8 & 2 & \mathrm {~B} \\\hline \mathrm { F } & 9 & 3 & \mathrm { C } , \mathrm { E } \\\hline \mathrm { G } & 13 & 1 & \mathrm { D } \\\hline \mathrm { H } & 14 & 2 & \mathrm { E } , \mathrm { G } \\\hline \mathrm { T } & 13 & 3 & \mathrm {~F} \\\hline \mathrm { K } & 10 & 1 & \mathrm { H } , \mathrm { J } \\\hline \mathrm { L } & 5 & 2 & \mathrm {~K} \\\hline\end{array}$$

A) 68 days
B) 70 days
C) 66 days
D) 72 days