1. This is adapted from Spring 2011 Exam 2 Question 3. Consider the following directed acyclic graph. The given graph represents a project with various tasks depicted by the circles (nodes). The time it takes to complete each task is shown beside each node below. A task cannot start unless all its predecessors have been completed. The project starts with task G and ends with task J 0(G ) A 3(E 5 A 4 kM2 (C
OR
OR