Activity Immediate predecessor Time (Days)
A - 3
B - 7
C A 4
D B 2
E C,D 5
F A 6
G E, F 3
Draw the network for this project.
Find the earliest, latest, and slack times for each activity.
Then find the Critical path.
This posting contains solution to following CPM problem.