Please write a program to solve 5 and compute the following:

5. Consider a set of six cities named a through f laid out on a uniform grid of grid length being unit in both X and Y directions. Compute the pair-wise distances between (6 x 5)/2- 15 distinct pairs of cities and build the 6 x 6 symmetric, weight matrix. Compute the MST and its cost using the two methods discussed in the class Compute all pair shortest paths between these six cities. 5. Consider a set of six cities named a through f laid out on a uniform grid of grid length being unit in both X and Y directions. Compute the pair-wise distances between (6 x 5)/2- 15 distinct pairs of cities and build the 6 x 6 symmetric, weight matrix. Compute the MST and its cost using the two methods discussed in the class Compute all pair shortest paths between these six cities