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. Which of the following paths would be infeasible?

A) A-B-D-G-J-L-M
B) A-B-E-G-J-L-M
C) A-C-F-H-K-M
D) A-B-D-G-I-M
E) A-C-F-I-G-J-L-M