<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with weighted edges [(0, 1, 3), (1, 2, 2), (2, 3, 1), (3, 4, 4)], how can you determine the normalized joint probability of occurrence of degree pairs for out-degree of the source node and in-degree of the target node?
### Response:
import networkx as nx

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

# Use the degree_mixing_dict function
degree_mix_dict = nx.degree_mixing_dict(G, x='out', y='in', weight='weight', normalized=True)

print(degree_mix_dict)
<|EOT|>
