NSFNET was a computer network from the $1980$s that connected the computer science departments of universities. In $1986,$ NSFNET connected $6$ departments across the US:

Diagram of $6$ routers in a network, with $7$ lines connecting them. No lines have arrows on them.

$*$ Line goes from San Diego to Illinois.

$*$ Line goes from San Diego to NCAR.

$*$ Line goes from Illinois to Pittsburgh.

$*$ Line goes from NCAR to Cornell.

$*$ Line goes from NCAR to Illinois.

$*$ Line goes from Pittsburgh to JVNC$.$

$*$ Line goes from Cornell to JVNC$.$

Redundancy in a network makes it more fault$-$tolerant. When two computers in a network are connected by multiple routes, that adds redundancy.

How many routes are there between NCAR and JVNC$?$

Choose $1$ answer:

Choose $1$ answer:

$($Choice A$)1$ route

A

$1$ route

$($Choice B$)2$ routes

B

$2$ routes

$($Choice C$)3$ routes

C

$3$ routes

$($Choice D$)4$ routes

D

$4$ routes