use prim's algorithm to find a minimal spanning tree for the times whose vertices are the hotels given in the distance chart. what is the total time for this spanning tree?