Question $8$

$0\mathrm{.}4pts$

Consider the following network diagram to answer Q$8$ Q$9$:

A company is designing a route to stop by every node $($i$.$e$.$ nodes A$-$H above$)$ at least once and return to where it started $($in minutes$).$

Q$8.$ Which of the following is NOT a possible pairing of odd vertices?

$AH$&$DE$

$AB$&$DE$

$AD$&$BE$

$AE$&$BD$

Question $9$

$0\mathrm{.}4$ pts

How long will it take to finish this travel?

$35$ minutes

$41$ minutes

$47$ minutes

$53$ minutes