<｜begin▁of▁sentence｜>### Instruction:
Given a graph with 10 nodes, can you generate a Turan Graph that is a complete multipartite graph with three disjoint subsets, and then print all of its nodes and edges?
### Response:
import networkx as nx

# Define the number of nodes 'n' and the number of subsets 'r'
n = 10
r = 3

# Create the Turan Graph
T = nx.turan_graph(n, r)

# Print the nodes and edges of the Turan Graph
print('Nodes:', T.nodes())
print('Edges:', T.edges())
<|EOT|>
