May you help me please :)
Extracted text: Use Kruskal's algorithm to find the minimum spanning tree of graph G. 5 m a 7 8 4 b. 2 4 5 10 G 7, e {b, x}, {a, u}, {c, u}, {b, c}, {a, v}, {b, d}, {u, m}, {c, b}: 35 {b, x}, {a, u}, {C, u}, {b, m}, {a, v}, {b, d}, {u, m}, {c, e}: 35 {b, x}, {a, u}, {C, u}, {b, c}, {a, v), {b, d}, {u, m}, {c, e}: 35 {b, x}, {a, u}, {c, u), {b, c}, {m, v}, {b, d}, {u, m}, {c, e): 35 a 3, O O O C