<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge list [(0, 1), (1, 2), (2, 0), (2, 3)], how can you check if each edge has a mutual edge (an opposite pair)?
### Response:
from igraph import Graph

# Define the edge list
edge_list = [(0, 1), (1, 2), (2, 0), (2, 3)]

# Create a directed graph with the edge list
g = Graph(edges=edge_list, directed=True)

# Check if each edge has a mutual edge
is_mutual_list = g.is_mutual(edges=None)

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