<｜begin▁of▁sentence｜>### Instruction:
Given a simple graph with edges (0, 1), (1, 2), (2, 3), (3, 4), how can you determine if a specific vertex is part of a maximum bipartite matching, and retrieve the set of edges that comprise this matching?
### Response:
from igraph import Graph

# Creating a graph
edges = [(0, 1), (1, 2), (2, 3), (3, 4)]
g = Graph(edges)

# Run the maximum bipartite matching algorithm
matching = g.maximum_bipartite_matching()

# Check if a specific vertex is matched
vertex_id = 2
is_matched = matching.is_matched(vertex_id)

# Get the edges in the matching
matched_edges = matching.edges()

# Print the results
print(f'Is vertex {vertex_id} matched:', is_matched)
print('Edges in the matching:', matched_edges)
<|EOT|>
