<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges [(0, 1), (1, 2), (2, 0), (2, 3), (3, 4), (4, 2)], how would you use igraph's feedback_arc_set function to find a set of edges that, when removed, makes the graph acyclic, and what are those edges?
### Response:
from igraph import Graph

# Define the directed edges for the graph
g = Graph(edges=[(0, 1), (1, 2), (2, 0), (2, 3), (3, 4), (4, 2)], directed=True)

# Calculate the feedback arc set
feedback_arc_set = g.feedback_arc_set()

# Print the edges to be removed to make the graph acyclic
print('Edges to remove:', feedback_arc_set)
<|EOT|>
