<｜begin▁of▁sentence｜>### Instruction:
Given a list of edges that represents an undirected graph, can you calculate and output the local transitivity (clustering coefficient) for each vertex in the graph using igraph's `transitivity_local_undirected` method?
### Response:
import igraph as ig

# Example graph data
edges = [(0,1), (1,2), (2,0), (2,3), (3,4), (4,5), (5,3)]

# Create undirected graph
graph = ig.Graph(edges=edges, directed=False)

# Calculate the local transitivity for each vertex
transitivity_local = graph.transitivity_local_undirected(vertices=None)

# Print the local transitivity (clustering coefficient) for each vertex
for idx, t_local in enumerate(transitivity_local):
    print(f'Vertex {idx}: Clustering Coefficient = {t_local}')
<|EOT|>
