For the input in the table below:

Draw the network

Identify the critical path

Calculate the earliestlatest starting and finishing times for each activity

Title	Activity (A)	Duration (D)	Earliest Start (ES)	Earliest Finish (EF)	Latest Start (LS)	Latest Finish (LF)
			Sum of longest Predecessors D	Expected D+ES	CP-(expected D +Sum of longest Successors D)	CP- sum of longest Successors D
A	1-2	4
B	1-3	3
C	2-4	2
D	2-5	7
E	3-5	6
F	4-6	4
G	5-6	2
For calculating LF for each event:
Start from the end and move to the left
Any activity (arrow) going to the end event (circle) equals to the CP
Any other activity (arrow) must be the CP minus the sum of longest successor activities