<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(1, 2), (2, 3), (3, 1), (3, 4), (1, 4)], how to compute the flow based edge connectivity using NetworkX?
### Response:
import networkx as nx

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

# Build auxiliary edge connectivity graph
H = nx.build_auxiliary_edge_connectivity(G)

# Calculate flow based edge connectivity
edge_connectivity = nx.edge_connectivity(H)

# Print edge connectivity
print("Edge connectivity:", edge_connectivity)
<|EOT|>
