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

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

# Calculate local node connectivity between nodes 1 and 5
connectivity = local_node_connectivity(G, 1, 5)

print('Local node connectivity between nodes 1 and 5:', connectivity)
<|EOT|>
