<｜begin▁of▁sentence｜>### Instruction:
Given the 'duplication_divergence_graph' function which generates an undirected graph using the duplication-divergence model with a desired number of nodes 'n' and an edge retention probability 'p', can you create a graph with 10 nodes where each edge has a 50% chance of being retained, and also set a seed for randomness control?
### Response:
import networkx as nx

# Use the duplication-divergence graph generation function
G = nx.duplication_divergence_graph(n=10, p=0.5, seed=42)

# Print the number of nodes and edges in the generated graph
print('Number of nodes:', G.number_of_nodes())
print('Number of edges:', G.number_of_edges())
<|EOT|>
