<｜begin▁of▁sentence｜>### Instruction:
Given a graph represented as an edge list [(0, 1), (1, 2), (2, 3), (3, 0), (1, 3), (2, 4)], can you find the biconnected components and articulation points using igraph's blocks function for the given graph?
### Response:
from igraph import Graph

# Create a graph from an edge list
edges = [(0, 1), (1, 2), (2, 3), (3, 0), (1, 3), (2, 4)]
g = Graph(edges)

# Calculate the biconnected components and articulation points of the graph
bicomponents, articulation_points = g.blocks(return_articulation_points=True)

# Print the biconnected components and articulation points
print('Biconnected components:', bicomponents)
print('Articulation points:', articulation_points)
<|EOT|>
