3. Consider the following graph: 12 7 6 11 2 20 5 3 10 4 9 1 8 (a) Draw a minimum spanning tree and compute its weight. (b) For both of Prim and Kruskal's algorithms, what is the order of the edges added to the minimum spanning tree? For any algorithm which starts at an arbitrary vertex, use the marked vertex at the top-left.