For the Following Eight Cities with the Given Distances, Find

Short Answer

For the following eight cities with the given distances, find the minimal spanning tree path. $$\begin{array} { c | c c c c c c c } & && { \text { To City } } \\\text { From City } & 1 & 2 & 3 & 4 & 5 & 6 & 7 \\\hline 1 & - & 5 & 2 & 6 & - & - & - \\2 & 5 & - & - & 4 & 6 & - & - \\3 & 2 & - & - & 3 &- & 12 & -\\4 & 6 & 4 & 3 & - & 9 & 8 & - \\5 & - & 6 & - & 9 & - & 0 & 14 \\6 & - & - & 12 & 8 & 0 & - & 4 \\7 & - & - & - & - & 14 & 4 & -\\\end{array}$$