<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set with weights is [(1, 2, 3), (1, 3, 2), (2, 4, 1), (3, 4, 4), (4, 5, 5)], can you compute the information centrality for each node using NetworkX's `information_centrality` function?
### Response:
import networkx as nx
from networkx.algorithms.centrality import information_centrality

# Create a graph
G = nx.Graph()

# Add edges with weights
G.add_weighted_edges_from(
    [(1, 2, 3), (1, 3, 2), (2, 4, 1), (3, 4, 4), (4, 5, 5)]
)

# Compute the information centrality
info_centrality = information_centrality(G, weight='weight')

print(info_centrality)
<|EOT|>
