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 M as well as the cost (in dollars) of 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 lowest cost option to travel from city A to city M. 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 M?

A) $76
B) $86
C) $96
D) $106
E) $116