please answer fast and I will rate you high, thank you!!!

The edges of the minimum spanning tree obtained for the given weighted graph in correct order using Kruskal's algorithm are 1 b 3 2 3 e 2 3 c 1 d For example, if x, y is an edge, write the edge as (x, y), separated by commas with one space after each comma