<｜begin▁of▁sentence｜>### Instruction:
Given a path graph with 6 nodes, how can you use the quotient_graph function to create a new graph that merges certain nodes into blocks? Specifically, nodes 0 and 1 should form one block, nodes 2 and 3 form another, and nodes 4 and 5 form the last block. Print the edges of the resulting quotient graph.
### Response:
import networkx as nx

# Create a graph
G = nx.path_graph(6)

# Define an equivalence partition
partition = [{0, 1}, {2, 3}, {4, 5}]

# Create the quotient graph
Q = nx.quotient_graph(G, partition, relabel=True)

# Print the edges of the quotient graph
print(list(Q.edges()))
<|EOT|>
