<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edges [('A', 'B'), ('B', 'C')] having weights 5 and 3 respectively, can you compute the average weighted degree of the neighborhood of each node using NetworkX?
### Response:
import networkx as nx

# Create an undirected graph with weights
G = nx.Graph()
G.add_edge('A', 'B', weight=5)
G.add_edge('B', 'C', weight=3)

# Compute the average neighbor degree
avg_neighbor_deg = nx.average_neighbor_degree(G, weight='weight')

print(avg_neighbor_deg)
<|EOT|>
