<｜begin▁of▁sentence｜>### Instruction:
Consider a directed graph with edges [(1, 2), (1, 3), (3, 2), (2, 4), (3, 4)]. What is the local reaching centrality of node 3 using NetworkX?
### Response:
import networkx as nx

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

# Compute the local reaching centrality for node 3
lrc = nx.local_reaching_centrality(G, 3)
print('Local reaching centrality for node 3:', lrc)
<|EOT|>
