Reading: Read sections 9.1, 13.1, 13.2, 13.3, 13.4
Is the given code a valid Prufer code? Without computing the Extended Prufer code, answer yes or no. If the answer is no, explain why. If the answer is yes, draw the corresponding tree.
Draw a connected weighted graph that has at least two different minimal spanning trees.
Draw a connected weighted graph which has a unique minimal spanning tree, but in which two edges have the same weight.
Find and draw a minimal spanning tree for the graph below.
What is the name of the algorithm you used in part (a)?