<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0, 1, {'weight': 3}), (1, 2, {'weight': 1}), (2, 3, {'weight': 4}), (3, 0, {'weight': 2}), (0, 2, {'weight': 5})], compute the minimum spanning tree using Kruskal's algorithm and print its edges along with their weights.
### Response:
import networkx as nx

# Create an undirected graph
G = nx.Graph()

# Add edges with weights
G.add_edges_from([(0, 1, {'weight': 3}), (1, 2, {'weight': 1}), (2, 3, {'weight': 4}), (3, 0, {'weight': 2}), (0, 2, {'weight': 5})])

# Compute the minimum spanning tree of the graph
T = nx.minimum_spanning_tree(G, weight='weight', algorithm='kruskal')

# Print the edges of the minimum spanning tree
print(sorted(T.edges(data=True)))
<|EOT|>
