<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(1, 2), (2, 3), (3, 1), (3, 4), (4, 5), (5, 3)], use the make_max_clique_graph function from NetworkX to create and print the maximal clique graph of the given graph. The nodes of this new graph are the maximal cliques, and there is an edge between two nodes if the corresponding cliques in the original graph are not disjoint.
### Response:
import networkx as nx

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

# Use the make_max_clique_graph function
H = nx.make_max_clique_graph(G)

# Print the edges of the maximal clique graph
print(H.edges())
<|EOT|>
