<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges defined as a list of tuples, can you determine if a specific edge has a mutual counterpart (an edge in the opposite direction between the same two vertices)? Use the is_mutual method associated with Edge objects in igraph to check this.
### Response:
from igraph import Graph

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

# Retrieve the Edge object
edge = g.es[0]

# Check if the edge is mutual
is_mutual = edge.is_mutual()
print(f'Is edge {edge.tuple} mutual? {is_mutual}')
<|EOT|>
