<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(1, 2), (1, 3), (2, 3), (3, 4), (3, 5)], can you check whether a set of edges {(1, 2), (3, 4)} represents a maximal matching in this graph using the NetworkX function 'is_maximal_matching'?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(1, 2), (1, 3), (2, 3), (3, 4), (3, 5)])

# Define a matching
matching = {(1, 2), (3, 4)}

# Check if the matching is maximal
is_maximal = nx.is_maximal_matching(G, matching)
print('Is the matching maximal?', is_maximal)
<|EOT|>
