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.

Which of the following paths would be infeasible?

A) A-B-C-E-G-I-J
B) A-B-C-F-E-G-I-J
C) A-B-D-G-I-J
D) A-C-F-J
E) A-C-F-E-G-I-J