Construct a network diagram schedule using the precedent diagram method $($activity on the arrow$).$ Complete a forward pass to calculate the project completion time. Your schedule should show:

$$ Tasks on arrows with durations

$$ Nodes with running times

$$ Start node with time zero

$$ Finish node with the project$$s time completion$\backslash$table$[[$Task$,$Predecessor,Duration$],[$A$,-,1],[$B$,$A$,2],[$C$,$A$,3],[$D$,$B$,6],[$E$,$B$,2],[$F$,$C$,8],[$G$,$D$,4],[$H$,$D$,4],[$I$,$E$,3],[$J$,$F$,5],[$K$,$G$,6],[$L$,$H$,$ I, J$,8],[$M$,$F$,6]]$