A (a) [2%] Assume that you're using Kruskal's algorithm to build the minimum spanning tree (MST). Indicate the edges selected in the second and the fifth steps. You get credits only if both answers are correct.
B (b) [2%] Assume that you're using Prim's algorithm to build the minimum spanning tree. Indicate the edges selected in the second and the fifth steps. You get credits only if both answers are correct.
C (c) [3%] You get credits only if your answers to the following three questions are all correct:
(1) Is the MST of this graph unique? Answer YES or NO.
(2) One can apply Dijkstra's algorithm to an undirected weighted graph from any vertex to obtain a spanning tree. Is this tree always a MST? Answer YES or NO.
(3) Give the number of edges in the MSTs obtained in (a) and (b).
