<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge set [(0, 1), (1, 0), (2, 3)], can you use the is_mutual function in igraph to check if specific edges have their mutual/opposite pairs in the graph?
### Response:
from igraph import Graph

# Create a directed graph with edges
edges = [(0, 1), (1, 0), (2, 3)]
g = Graph(edges, directed=True)

# Check if the edge (0, 1) has a mutual/ opposite pair
is_mutual = g.is_mutual((0, 1))
print('Edge (0, 1) is mutual:', is_mutual)

# Check if the edge (2, 3) has a mutual/ opposite pair
is_mutual = g.is_mutual((2, 3))
print('Edge (2, 3) is mutual:', is_mutual)
<|EOT|>
