<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge set [(1, 2), (1, 3), (2, 3), (3, 4), (4, 5), (1, 5)], what is the approximate node connectivity of the graph, i.e., the minimum number of nodes that must be removed to disconnect the graph or render it trivial using an approximation algorithm provided by NetworkX?
### Response:
import networkx as nx
from networkx.algorithms import approximation as approx

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

# Compute an approximation of the node connectivity of the graph
connectivity = approx.node_connectivity(G)

print('Approximate node connectivity of the graph:', connectivity)
<|EOT|>
