<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edge set [(0, 1), (0, 2), (1, 2), (3, 4), (4, 5), (3, 5)], can you use VertexClustering.sizes function in igraph to find the size of the clusters obtained by community detection?
### Response:
from igraph import Graph
import igraph as ig

g = ig.Graph(edges=[(0, 1), (0, 2), (1, 2), (3, 4), (4, 5), (3, 5)])
# Perform community detection to cluster the graph
clustering = g.community_edge_betweenness()
# Convert it to VertexClustering
vertex_clustering = ig.VertexClustering(g, clustering.membership)
# Get the sizes of the clusters
cluster_sizes = vertex_clustering.sizes()
print(cluster_sizes)
<|EOT|>
