<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with the edge set [(1, 2), (2, 3), (3, 1), (3, 4), (4, 2)], can you find all the chordless cycles using the NetworkX 'chordless_cycles' function?
### Response:
import networkx as nx

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

# Find all the chordless cycles in the graph
chordless_cycles_list = list(nx.chordless_cycles(G))

# Print the chordless cycles
for cycle in chordless_cycles_list:
    print(cycle)
<|EOT|>
