<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edge set [(0, 1), (0, 2), (1, 2), (3, 4)], can you use independent_vertex_sets function in igraph to find and print all the independent vertex sets?
### Response:
from igraph import Graph

# Define the edges for an undirected graph
g = Graph(edges=[(0, 1), (0, 2), (1, 2), (3, 4)], directed=False)

# Find independent vertex sets
ind_sets = g.independent_vertex_sets()

# Print the independent vertex sets
print(ind_sets)
<|EOT|>
