According to the data in the following table, construct a project network for the following set of activities and answer the following questions.

$\backslash$table$[[$Activity$,\backslash$table$[[$Immediate$],[$Processor$]],\backslash$table$[[$Activity Time$],[($days$)]]],[$A$,-,6],[$B$,-,8],[$C$,$A$,$ B$,5],[$D$,$B$,4],[$E$,$C$,7],[$F$,$C$,$ D$,3],[$G$,$D$,6],[$H$,$E$,$ F$,$ G$,5]]$

$($a$)$ Draw the project network $($use AON convention$).$

$($b$)$ Compute the length of each path in the network, identify the critical path and compute the minimum completion time of the project.

$($c$)$ Compute ES$,$ EF$,$ LS and LF and slack time for each activity in the network.

Please go over the question on how to solve as well. Will UPVOTE