#### Answer

The solution found by the best-fit algorithm is the path from Leesburg to Dayton and then to Bedford. This path is not the shortest route.
see the following image

Chegg costs money, GradeSaver solutions are free!

Published by
Pearson Higher Education

ISBN 10:
1292061162

ISBN 13:
978-1-29206-116-0

You can help us out by revising, improving and updating this answer.

Update this answerAfter you claim an answer you’ll have **24 hours** to send in a draft. An editor
will review the submission and either publish your submission or provide feedback.