In the following weighted Graph, and based on the highest numerical value being the most efficient route, identify the most efficient route between Austin and Washington? Enter your answers as $($e$.$g$.$ A$-$B$-$C$-$D$)$ using letters and dashes with the city names replacing the letters in the example given.

Q$7.$png

Group of answer choices

AUSTIN$-$DALLAS$-$DENVER$-$ATLANTA$-$WASHINGTON

AUSTIN$-$DALLAS$-$CHICAGO$-$DENVER

AUSTIN$-$DALLAS$-$CHICAGO$-$DENVER$-$ATLANTA$-$WASHINGTON

AUSTIN$-$WASHINGTON

AUSTIN$-$DALLAS$-$DENVER$-$ATLANTA$-$WASHINGTON