Draw a critical path network from the above info

Activities A and B have no predecessors, so they start from a common 'Start' node.

• Activity C depends on A.
• Activity D depends on A and B. This requires a merge point for A and B before D can start.
• Activity E depends on C.
• Activity F depends on D.
• Activity G depends on E and F. This requires a merge point for E and F before G can start.

The durations are: A=4, B=6, C=3, D=5, E=4, F=3, G=2.

The critical path network diagram is shown below. Each node represents an event, and each arrow represents an activity with its duration.

Here is a more visual representation of the network:

(Start)
   |
   |-- A (4 weeks) --> (Node 1) -- C (3 weeks) --> (Node 2) -- E (4 weeks) --> (Node 3)
   |                                                                               |
   |-- B (6 weeks) --> (Node 4) -- D (5 weeks) --> (Node 5) -- F (3 weeks) --> (Node 6)
                                                                               |
                                                                               V
                                                                             (Node 7) -- G (2 weeks) --> (End)

Note: Node 7 represents the merge point of E and F before G can start.