<｜begin▁of▁sentence｜>### Instruction:
Given a directed weighted graph with edge set [('A', 'B', weight=2), ('A', 'C', weight=3), ('B', 'C', weight=4), ('C', 'A', weight=1)], what is the normalized degree mixing dictionary based on the in-degrees and out-degrees of the nodes?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()
# Add some edges with weights
G.add_edge('A', 'B', weight=2)
G.add_edge('A', 'C', weight=3)
G.add_edge('B', 'C', weight=4)
G.add_edge('C', 'A', weight=1)

# Get the degree mixing dict for in-degrees and out-degrees
mixing = nx.degree_mixing_dict(G, x='out', y='in', normalized=True)

print('Degree mixing dictionary (normalized):', mixing)
<|EOT|>
