<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with vertices 0, 1, and 2, and with edges (0 -> 1), (1 -> 0), and (1 -> 2), can you use the GraphBase.is_mutual function in igraph to check which edges have an opposite pair and indicate whether each edge is mutual?
### Response:
import igraph as ig

# Create an example graph
g = ig.Graph(directed=True)
g.add_vertices(3)
g.add_edges([(0, 1), (1, 0), (1, 2)])

# Check if the edges are mutual
mutual_edges = g.is_mutual()

# Print the results
for idx, edge in enumerate(g.es):
    print(f"Edge {edge.tuple} is mutual: {mutual_edges[idx]}")
<|EOT|>
