please show work

1. ( 24 points) The figure below shows the location of the main railroad terminals in the United States, and the existing railroad tracks (and distances in miles) between them. Determine the set of tracks that link all of the terminals, directly or indirectly, such that the total length of the selected tracks is minimized. First solve the problem using Prim's Algorithm, then solve it using Kruskal's Algorithm. For each solution, specify the algorithm that you are using, and write out the order in which ares are added during construction of your spanning tree. You may use TORA afterwards if you wish to verify the minimum total length of your spanning tree