<｜begin▁of▁sentence｜>### Instruction:
Given an Erdős-Rényi graph with 10 nodes and a connection probability of 0.5, can you use the 'largest_cliques' function in igraph to find the largest cliques in the graph?
### Response:
from igraph import Graph

g = Graph.Erdos_Renyi(n=10, p=0.5)

# Find the largest cliques in the graph
largest_cliques = g.largest_cliques()

# Print the largest cliques
for clique in largest_cliques:
    print('Clique:', clique)
<|EOT|>
