<｜begin▁of▁sentence｜>### Instruction:
As a restaurant manager, imagine you're looking at your seating plan, which is organized into a linear arrangement of 10 tables — each representing a node in a path graph. Now, you're interested in figuring out the best way to seat a group of friends who want to sit together (a clique) and at the same time, accommodate individuals who prefer to dine alone with some space (an independent set). Using NetworkX's 'clique_removal' function, how might you approximate the largest possible group that can be seated together as well as determine the maximum number of solo diners that can be spaced out throughout this linear dining arrangement? Remember, we're working with a theoretical model of your restaurant seating chart for this exercise.
### Response:
import networkx as nx

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

# Apply the clique removal approximation algorithm
result = nx.approximation.clique_removal(G)

# Extract the independent set and cliques from the result
independent_set, cliques = result

# Output the results
print('Independent set:', independent_set)
print('Cliques:', cliques)
<|EOT|>
