<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(0, 1), (0, 2), (1, 2), (1, 3), (1, 4), (4, 5)], can you compute the rich-club coefficient for each degree using NetworkX without normalization?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(0, 1), (0, 2), (1, 2), (1, 3), (1, 4), (4, 5)])

# Calculate the rich-club coefficient without normalization
rc = nx.rich_club_coefficient(G, normalized=False, seed=42)

# Print the rich-club coefficient for each degree
for degree, coef in rc.items():
    print(f'Degree {degree}: Rich-club coefficient {coef}')
<|EOT|>
