Dick Tater is the candidate of the Know Nothing Party (you can read more about them at https: //en.wikipedia.org/wiki/Know_Nothing) in the upcoming presidential election. He plans to visit 30 locations in "swing states" around the United States to give campaign speeches. Due to old age, he has very limited endurance, and therefore it is imperative to minimize the total travel time. His campaign manager asked you (an optimization expert who is keen to help defeat his lousy opponent) to find the sequence for him and his campaign staff to visit all 30 locations with minimum travel time