The Figure Below Shows the Possible Routes from City a to City

Multiple Choice

The figure below shows the possible routes from city A to city J as well as the time (in minutes) required for a trip between each pair of cities (note that if no arc joins two cities it is not possible to travel non-stop between those two cities) . A traveler wishes to find the quickest option to travel from city A to city J.
Note: This question requires Solver.
Formulate the problem in Solver and find the optimal solution. Which of the following nodes are not visited?

A) B
B) E
C) H
D) B and E
E) E and H