Consider the network presented in the following table. Calculate

a$.$ All possible paths

b$.$ The critical path

c$.$ The slack available at any non$-$critical points

d$.$ The minimum project duration

$\backslash$table$[[,,$Immediate$],[$Task$,$Duration $($Days$),$Predecessors$],[$A$,5,$None$],[$B$,3,$A$],[$C$,4,$A$],[$D$,2,$C$],[$E$,1,$B$,$D$]]$