<｜begin▁of▁sentence｜>### Instruction:
Given a joint degree dictionary {1: {2: 2}, 2: {1: 2}}, which indicates the number of edges joining nodes of degree 1 with nodes of degree 2 (and vice versa) is 2, determine if such a dictionary is realizable as a simple graph using the NetworkX function `is_valid_joint_degree`.
### Response:
import networkx as nx

# Define a joint degree dictionary with degrees {1: {2: 2}, 2: {1: 2}}
joint_degrees = {1: {2: 2}, 2: {1: 2}}

# Check if the joint degree is realizable as a simple graph
is_realizable = nx.is_valid_joint_degree(joint_degrees)

print('Is the joint degree dictionary realizable?', is_realizable)
<|EOT|>
