$($B$)$

ing activities with their predecessor activities and activity duration are given for a

Draw the network diagram

Calculate Earliest start time and Latest finish time

Identify Critical Path

earliest finish and latest start of activities.

$\backslash$table$[[$Activity$,$A$,$B$,$C$,$D$,$E$,$F$,$G$,$H$,$I$],[$Predecessor$,-,-,$A$,$B$,$C$,$D$,$C$,$D$,$E$,$F$,$G$,$H$],[$Time$,5,4,6,2,1,7,8,4,3]]$