Activity Predecessor Activity Duration Estimate

A $-2$

B A $2$

C A $3$

D A $4$

E B $2$

F C $3$

G D $6$

H E$,$ F $2$

I E$,$ F $5$

J G$,$ I $1$

K H$,$ J $2$

a$.$ Drawn an AON $($activity on node$)$ network diagram representing the project above. Show ES$,$ EF$,$ LS$,$ LF$,$ project duration, critical path.

b$.$ Identify all the paths of the network diagram and note how long they are.

c$.$ What is the shortest possible time it will take to complete this project?