<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(1, 2), (2, 3), (3, 4), (4, 5), (1, 3), (2, 4)], can you use NetworkX to compute the node connectivity of the graph, which represents the minimum number of nodes that must be removed to disconnect the graph?
### Response:
import networkx as nx

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

# Calculate node connectivity of the graph
connectivity = nx.node_connectivity(G)
print('Node connectivity of the graph:', connectivity)
<|EOT|>
