<｜begin▁of▁sentence｜>### Instruction:
Given a cycle graph with the edge set [(1, 2), (2, 3), (3, 4), (4, 5), (5, 1)], can you find all the local bridges and their spans using NetworkX?
### Response:
import networkx as nx

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

# Use local_bridges to find edges that are local bridges
# and also compute the span of these bridges.
local_bridges_with_span = list(nx.local_bridges(G, with_span=True))

print('Local bridges with span:', local_bridges_with_span)
<|EOT|>
