<｜begin▁of▁sentence｜>### Instruction:
Given a simple undirected graph with the edge set [(0, 1), (0, 2), (1, 2), (1, 3)], can you use the VertexDendrogram.optimal_count attribute to determine the optimal number of clusters for this graph when applying community detection using edge betweenness?
### Response:
from igraph import Graph

# Construct a graph
edges = [(0, 1), (0, 2), (1, 2), (1, 3)]
g = Graph(edges)

# Get the dendrogram object from community detection
vd = g.community_edge_betweenness(directed=False).as_clustering()

# Find the optimal count for the dendrogram
optimal_count = vd.optimal_count
print('Optimal count:', optimal_count)
<|EOT|>
