1. **Problem Statement:** We have a set of tasks with durations and predecessor dependencies. We want to draw a PERT chart, which is a directed acyclic graph (DAG) representing tasks as nodes and dependencies as edges. 2. **Understanding PERT Chart:** - Each task is a node. - Directed edges go from predecessor tasks to dependent tasks. - Duration is a weight on each node. - The graph must be acyclic. 3. **Tasks and Dependencies:** - A (Requirement Analysis): duration 5, no predecessor. - B (Systems Design): duration 15, predecessor A. - C (Programming): duration 25, predecessor B. - D (Telecoms): duration 15, predecessor B. - E (Hardware Installation): duration 30, predecessor B. - F (Integration): duration 10, predecessors C and D. - G (System Testing): duration 10, predecessors E and F. - H (Training/Support): duration 5, predecessor G. - I (Handover and Go-Live): duration 5, predecessor H. 4. **Constructing the PERT Chart:** - Start with node A. - Draw an arrow from A to B. - From B, draw arrows to C, D, and E. - From C and D, draw arrows to F. - From E and F, draw arrows to G. - From G, draw an arrow to H. - From H, draw an arrow to I. 5. **Summary:** The PERT chart is a DAG with nodes A through I connected by edges representing dependencies as described. Final answer: The PERT chart is constructed as above with nodes and directed edges representing task dependencies and durations.