<｜begin▁of▁sentence｜>### Instruction:
Given a graph where the edges are as follows: [(0, 1), (1, 2), (2, 3), (3, 4), (0, 4)], and assuming that a community detection algorithm has been run to obtain a clustering of the graph, how would you use the VertexClustering.VertexClustering.subgraph API in igraph to extract and print a summary of the subgraph belonging to the first cluster?
### Response:
from igraph import Graph

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

# Perform a community detection to create clusters
community = g.community_edge_betweenness()
clusters = community.as_clustering()

# Get the subgraph for the first cluster
subgraph = clusters.subgraph(0)

# Print the subgraph summary
print(subgraph.summary())
<|EOT|>
