<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph whose edge set is [(1, 2), (1, 3), (3, 2)], can you compute 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)])

# Compute the local reaching centrality of node 3
reaching_centrality = nx.local_reaching_centrality(G, 3)

print('Local reaching centrality of node 3:', reaching_centrality)
<|EOT|>
