Extracted text: Use Kruskal's algorithm to find the minimum spanning tree of graph G. 11 9 3 3 1 18 G 11 {m, x}, {a, u}, {c, u}, {u, m}, {b, c}, {a, v}, {b, d}, {c, e}: 30 {b, x}, {a, u}, {c, u), {u, m}, {b, c}, {a, v}, {b, d}, {c, e}: 30 {b, x}, {a, u}, {c, u), {u, m}, {b, c}, {a, v}, {b, d}, {c, e}: 31 a d. {b, x}, {a, u}, {c, u), {u, m}, {b, c}, {m, v}, {b, d}, {c, e}: 30 9,