You have three errands to run around town, in no particular order. You plan to start and end at home. You must go to Home Depot, Stop & Shop, Walmart, and the post office. Distance in miles, between any two of these locations is given in the table. Create a complete weighted graph that models the information given in the table. Use the Brute Force Method to find the shortest route to run your errands and return home. What is the minimum distance you can travel? Use Kruskal's Algorithm to find the minimum spanning tree for the following graph. Draw the solution and give the minimum weight.