Consider the project network below:

Determine the critical path for the project. What are the earliest and latest times for each node from $1$ to $7?$ What is the total

time for the project?

Compute the floats and identify the red$-$flagged activities for the project $($noncritical activities with FF $$ TF$),$ then develop the

time schedule under the following conditions:

Activity $(1,5)$ cannot start any earlier than $14.$

Activities $(5,6)$ and $(5,7)$ use the same equipment, of which only one unit is available.

All other activities start as early as possible.

Solve the problem using TORA.