The Ackermans live in Tunkhannock, Pennsylvania (T), and are planning their summer vacation. They wish to visit the following national parks: Acadia (A), Cuyahoga Valley (C), and Great Smoky Mountains (S). The approximate distances among these locations are as follows: T to A is 582 miles, T to C is 342 miles, T to S is 663 miles, A to C is 917 miles, A to Sis 1188 miles, and C to Sis 521 miles. 

(a) Represent this traveling salesman problem with a complete, weighted graph showing the distances along the edges. 

(b) Use the brute force method to determine the shortest route for the Ackermans to visit each national park and return to their home. 

(c)  What is the minimum distance the Ackermans can travel?