2. An agent from Harvard Business Publishing wants to visit 5 colleges in Boston area to address their needs of course materials and to see if they have any suggestion for improving the contents of HBP website. Given the matrix of pairwise distances (in miles) between these colleges, she wants to find the best way to visit all these schools exactly once. Her home school is school B and she has to return to school B after visiting all other schools. (3) Draw the associated graph and label the edges with the corresponding distances. (b) Find the shortest possible tour to visit all 5 schools using the nearest neighbor heuristic. Clearly present the details of the calculations and the process of determining the next node and where to insert it at each iteration. (c) Find the shortest possible tour to visit all 5 schools using the nearest insertion algorithm. Clearly present the details of the calculations and the process of determining the next node and where to insert it at each iteration. (d) Find the shortest possible tour to visit all 5 schools using the farthest insertion algorithm. Clearly present the details of the calculations and the process of determining the next node and where to insert it at each iteration. (e) Find the shortest possible tour to visit all 5 schools using the cheapest insertion algorithm. Clearly present the details of the calculations and the process of determining the next node and where to insert it at each iteration