<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges (0, 1) and (1, 0), can you check if the edge from node 0 to node 1 has a mutual edge from node 1 to node 0 using the is_mutual method from the igraph library?
### Response:
from igraph import Graph

# Create a directed graph
g = Graph(directed=True)

# Add edges
g.add_edges([(0, 1), (1, 0)])

# Get the edge object
edge = g.es[0]

# Check if the edge is mutual
is_edge_mutual = edge.is_mutual()

# Print the result
print(is_edge_mutual)
<|EOT|>
