To celebrate his retirement, Baron (B) wishes to ride his motorcycle to visit his friends Woody (W), Marcellus (M), and Simeon (S). The approximate distances between the homes of these friends are as follows: B to W is 940 miles, B to M is 507 miles, B to S is 374 miles, W to M is 799 miles, W to S is 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 Baron to visit his friends and return home.

c) What is the minimum distance that Baron can travel?