The State College of Florida Brain Bowl team is in Bradenton, Florida (B), and is planning a trip over spring break. The team plans to visit Washington, DC (W); Montgomery, AL (M); and Savannah, GA (S). The approximate distances among these cities are as follows: B to W is 940 miles, B to M is 507 miles, B to Sis 374 miles, W to M is 799 miles, W to Sis 575 miles, and M to S is 332 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 team to visit these locations and return to Bradenton.

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