3. Consider the following undirected, weighted graph: Apply Kruskal's algorithm to compute a minimum spanning tree (MST). In the designated spaces below, write down the edges in the order they are considered by the algorithm. If the edge is part of the MST found by the algorithm, write it down in the first list of edges that form the MST Write down the other edges considered in the order you considered them. Assume that the algorithm terminates as soon as an MST has been found. 12 3 3 10 a) Edges that form part of the MST, in the order considered: b) Other edges considered, but not included in the MST, in the order considered: c Is there another MST in addition to the one you listed in (a)? Explain