Using the table below, draw a network diagram in the PDM style and perform CPM Analysis to:

$\backslash$table$[[$Activty$,\backslash$table$[[$Duration$],[($Days$)]],$Predecessors$],[$A$,3,-],[$B$,4,$A$],[$C$,2,$A$],[$D$,1,$B$],[$E$,5,$B$],[$F$,8,$C$],[$G$,6,$D$,$ E$,$ F$],[$H$,7,$F$],[$I$,2,$G$,$ H$]]$

a$.$ Identify all project paths and the estimated duration of each

b$.$ Identify the estimated shortest project duration

c$.$ Identify the Critical Path $($and its duration

d$.$ Calculate Activity Slack using the Forward and Backward pass technique

e$.$ Answer the following questions:

If activity $E$ is delayed $2$ days, can $G$ be delayed without affecting the project finish date?

If the duration of activity $D$ takes $3$ extra days, how long will the project take to finish?

If activity $F$ takes $11$ days to complete, what is the earliest day that activity $G$ will finish?

Copy and paste the object to the left $($once for each activity$)$ replacing the $d$ with the duration and the Activity with the "name" from the table above.

Arrange to reflect the dependencies noted above. Insert arrows to complete the Network Diagram. Then delete this box!