<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge set [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3)], how can you compute the out-degree centrality for each node using NetworkX? Which node has the highest out-degree centrality in this graph, and what is its centrality value?
### Response:
import networkx as nx

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

# Compute the out-degree centrality
centrality = nx.out_degree_centrality(G)

print(centrality)
<|EOT|>
