<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(1, 2), (1, 3), (2, 3), (3, 4), (4, 5)], how can you create and display the maximal clique graph using NetworkX?
### Response:
import networkx as nx

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

# Create the maximal clique graph
max_clique_graph = nx.make_max_clique_graph(G, create_using=nx.Graph)

# Print the nodes of the maximal clique graph
print('Nodes of the maximal clique graph:', max_clique_graph.nodes())
# Print the edges of the maximal clique graph
print('Edges of the maximal clique graph:', max_clique_graph.edges())
<|EOT|>
