Consider the project information in the table below:

$\backslash$table$[[$Activities$,$Duration $($days$),\backslash$table$[[$Immediate$],[$Predecessors$]]],[$A$,8,-],[$B$,9,-],[$C$,8,$B$],[$D$,11,$A$],[$E$,6,$A$],[$F$,6,$B$],[$G$,5,$C$],[$H$,4,$C$],[$I$,5,$F$,$ G$,$ H$],[$J$,2,$D$,$ E$,$ I$]]$

Draw and analyze a project network diagram to answer the following questions:

What is the earliest that Activity $H$ can possibly be completed?

A$.22$ days

B$.19$ days

C$.18$ days

D$.21$ days

E$.20$ days