Given the following small project for an AOA network,

$\backslash$table$[[$Activity$,$Immediate Predecessor$($s$),$Time Duration $($days$)],[$A$,$None,$10],[$B$,$None,$2],[$C$,$A$,$ E$,9],[$D$,$None,$3],[$E$,$B$,$ D$,5]]$

How many paths are there in this AOA network?

Keep your own AOA graph.

Select one:

a$.3$ paths

b$.4$ paths

c$.6$ paths

d$.5$ paths

e$.7$ paths