Given the following tasks data for a project,

$\backslash$table$[[$Task Label,Predecessor,Duration $($weeks$)],[$A$,-,5],[$B$,-,3],[$C$,-,4],[$D$,$A$,1],[$E$,$B$,2],[$F$,$B$,5],[$G$,$B$,9],[$H$,$C$,$D$,$E$,4],[$I$,$F$,2]]$

a$.$ Draw the CPM network $($AON$)$ diagram

I. Determine the earliest start and latest start, earliest finish and latest finish times for each task. Use the following format to draw the network diagram and to present your answers.

$-$Earliest start $=$ maximum EF of immediate predecessors $EF=ES+t$

$-$Latest finish $=$ minimum of latest start of following activities $LS=LF-t$

II$.$ Identify the total slack, free slack, safety slack, and independent slack for each task.

III. Determine the critical path.

IV$.$ Determine the minimum project completion time.

b$.$ Draw the Gantt chart

I. Determine the project completion time.

II$.$ Determine each task's total slack.