<｜begin▁of▁sentence｜>### Instruction:
Given parameters for number of nodes `n=100`, number of edges with which a new node attaches to existing nodes `m=2`, probability value for adding an edge between existing nodes `p=0.05`, probability value of rewiring of existing edges `q=0.05`, and a seed value for random number generation `seed=42`, use the extended Barabási–Albert model to generate a graph. How many nodes and edges does the resulting graph have?
### Response:
import networkx as nx

# Generate an extended Barabási–Albert graph
eba_graph = nx.extended_barabasi_albert_graph(n=100, m=2, p=0.05, q=0.05, seed=42)

# Display the number of nodes and edges
eba_num_nodes = eba_graph.number_of_nodes()
eba_num_edges = eba_graph.number_of_edges()

print('Number of nodes:', eba_num_nodes)
print('Number of edges:', eba_num_edges)
<|EOT|>
