<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edges [(1, 2), (2, 3), (3, 1), (3, 4), (4, 5), (5, 3)], can you find the minimum cycle basis for the graph?
### Response:
import networkx as nx

# Create a simple undirected graph with some cycles
G = nx.Graph()
G.add_edges_from([(1, 2), (2, 3), (3, 1), (3, 4), (4, 5), (5, 3)])

# Compute the minimum cycle basis
mcb = nx.minimum_cycle_basis(G)

# Print the minimum cycle basis
print(mcb)
<|EOT|>
