State true $($T$)$ or false $($F$),$ and give reasons for false statement:

On drawing any activity in any network, we must know only all successors.

For any activity, the activities after it are called predecessors.

In precedence networks, the arrow lengths represent the activity durations.

A precedence network should start and end with a single activity.

No more than one critical path can be found in a network.