<｜begin▁of▁sentence｜>### Instruction:
Given the edges of a graph, [(0, 1), (0, 2), (1, 3), (2, 3), (3, 4)], compute the load centrality for each node in this graph. Load centrality measures the fraction of all shortest paths that pass through a given node. Use the NetworkX library to calculate this metric and print the centrality value for each node.
### Response:
import networkx as nx

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

# Compute the load centrality of each node
load_centrality_values = nx.load_centrality(G, normalized=True, weight=None, cutoff=None)

# Print the load centrality values for each node
for node, centrality in load_centrality_values.items():
    print(f'Node {node}: Load Centrality = {centrality}')
<|EOT|>
