<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edges [(0, 1), (1, 2), (2, 3), (3, 0), (0, 1)], can you determine if it is a simple graph (has no loops or multiple edges) using the is_simple method in igraph?
### Response:
import igraph as ig

# Create a graph with potential loops and multiple edges
g = ig.Graph([(0, 1), (1, 2), (2, 3), (3, 0), (0, 1)]) # This graph is not simple because it contains a multiple edge

# Check if the graph is simple using Graph.is_simple
g_is_simple = g.is_simple()

print('The graph is simple:', g_is_simple)
<|EOT|>
