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. What is the minimum cost for the traveler to move from node A to node J?

A) 305 minutes
B) 310 minutes
C) 315 minutes
D) 320 minutes
E) 325 minutes