P$11-1$ Drawing simple CPM diagram and determining critical path

From the following information draw a network showing the critical path and calculate the minimum time required to complete the work.

$\backslash$table$[[$Activity$,$Duration $($days$)],[$A$,1],[$B$,2],[$C$,3],[$D$,1],[$E$,8],[$F$,3],[$G$,2],[$I$,1]]$

A must be completed before starting the other activities, B$,$ C and E can commence concurrently after completion of A$.$ D can commence after completion of B and C$.$ F can commence after completion of $C$ and $E.$ G follows $F,$ and $H$ follows $D.$ I can commence after completion of $G$ and $H.$ Number your nodes.