<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edges defined as [(0, 1), (0, 2), (1, 3), (2, 3)], can you use the maximal_independent_vertex_sets method to find all the maximal independent vertex sets in the graph?

Use the provided Graph object, and display all of the maximal independent vertex sets. Note that these sets are independent collections of vertices where no two vertices within the same set are adjacent, and no additional vertices can be added to the set without breaking its independence.
### Response:
from igraph import Graph

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

# Find all maximal independent vertex sets
maximal_indep_sets = g.maximal_independent_vertex_sets()

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