<｜begin▁of▁sentence｜>### Instruction:
Picture this: you're creating a new piece for an art installation that's inspired by human connections. Think of it as a series of friendships represented by a tangled network of strings on a canvas where each knot signifies a person and each string section between knots represents a friendship. You've got a particular set of friendships mapped out as: [(1, 2), (1, 3), (2, 3), (2, 4), (3, 5), (4, 5)].

Now, here's the creative challenge. You aim to highlight certain friendships in bold strings to capture a striking balance. But each person can only appear once in the highlighted series for a strong visual impact. Also, you want to select the maximum number of friendships possible without breaking this rule.

How would you go about choosing which friendships to highlight if you want to respect these artistic constraints and create the most balanced and intricate piece? Remember, it's not just about the connections—it's about finding harmony in the complexity of relationships.
### Response:
import networkx as nx

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

# Find a maximal matching
matching = nx.maximal_matching(G)

# Sort and print the matching
print(sorted(matching))
<|EOT|>
