<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0, 1), (0, 2), (1, 3), (2, 3), (3, 4), (1, 2)], find all the simple chordless cycles using NetworkX.
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(0, 1), (0, 2), (1, 3), (2, 3), (3, 4), (1, 2)])

# Find chordless cycles
chordless = list(nx.chordless_cycles(G))

print(chordless)
<|EOT|>
