<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0, 1), (0, 2), (1, 3), (2, 3)], can you use igraph's is_bipartite function to determine if the graph is bipartite, and if so, can you retrieve the two disjoint sets that make up the bipartition?
### Response:
import igraph as ig

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

# Check if the graph is bipartite and get the two parts if it is
is_bipartite, parts = g.is_bipartite()

# Print the result and the parts (if bipartite)
print('Is bipartite:', is_bipartite)
if is_bipartite:
    print('Parts:', parts)
<|EOT|>
