6. Based on Prims algorithm given in the text and lecture notes, present the set X of vertices whose path to source in the minimal spanning tree is known and the content of the tables distance and neighbor at each step when a remaining vertex, for which the path to source in the minimal spanning tree has been found, is added to X. Assume that vertex 0 is the source. Note that if there is a tie, you are required to pick the vertex with the smallest label. (12 pts)