<｜begin▁of▁sentence｜>### Instruction:
Given a bipartite graph with vertices 0-1 in one set and vertices 2-3 in another set, with edges connecting vertices from different sets ((0,2), (0,3), (1,2), (1,3)), can you find a maximum matching in the graph using the maximum_bipartite_matching function in igraph?
### Response:
from igraph import Graph

# Define the edges of the bipartite graph
edges = [(0, 2), (0, 3), (1, 2), (1, 3)]

# Create the graph
g = Graph(edges=edges)

# Define the types for a bipartite graph: vertices 0-1 belong to one set (type 0),
# and vertices 2-3 belong to the other set (type 1)
types = [0, 0, 1, 1]

# Set the 'type' attribute for the vertices
g.vs['type'] = types

# Find a maximum matching in the bipartite graph
matching = g.maximum_bipartite_matching()
print(matching)
<|EOT|>
