9514 1404 393
Answer:
(b) 8
Step-by-step explanation:
We assume that a path must not repeat any node. (So, loops at G are forbidden.)
There are 2 paths through B to A.
There are 2 paths through D to A, so a total of 4 ways to get from C to A.
There is one path from A to H.
There are two paths from H to F, and one path from F to E.
The total number of possible paths is (4)(1)(2)(1) = 8.
Here is a list.
CBAHFE, CDBAHFE, CBAHGFE, CDBAHGFE,
CDAHFE, CBDAHFE, CDAHGFE, CBDAHGFE
