<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edges set as [(1, 2), (1, 3), (3, 4), (2, 4), (4, 5)], can you find the approximate maximum clique using the NetworkX approximation method?
### Response:
import networkx as nx
from networkx.algorithms import approximation

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

# Find the approximate maximum clique
max_clique = approximation.max_clique(G)
print('Maximum clique:', max_clique)
<|EOT|>
