<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edges set as (0, 1), (1, 2), (2, 3), (0, 3), and (4, 5), can you use the 'maximal_independent_vertex_sets' function in igraph to find and print all maximal independent vertex sets of the graph?
### Response:
import igraph as ig

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

# Get the maximal independent vertex sets
max_ind_sets = g.maximal_independent_vertex_sets()

# Print the maximal independent vertex sets
for ind_set in max_ind_sets:
    print(ind_set)
<|EOT|>
