<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edge set [(0, 1), (1, 2), (2, 3), (3, 4), (4, 0), (0, 2), (1, 3)], how can you compute the maximum clique using NetworkX?
### Response:
import networkx as nx
from networkx.algorithms import approximation

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

# Find the maximum clique
max_clique_set = approximation.max_clique(G)
print(f'Maximum clique of the graph: {max_clique_set}')
<|EOT|>
