<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0, 1), (1, 2), (2, 0), (2, 2), (1, 1)], where loops and multiple edges are allowed, can you use the `is_simple` function in igraph to check whether the graph is simple (no loop or multiple edges)? Note: You need to print whether the graph is simple.
### Response:
from igraph import Graph

# Define the edges for the graph
edges = [(0, 1), (1, 2), (2, 0), (2, 2), (1, 1)]

# Create the graph with the defined edges
# Allow loops and multiple edges for this example
g = Graph(edges=edges, directed=False, loops=True, multiple=True)

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

# Print whether the graph is simple or not
print('Is the graph simple?', is_simple)
<|EOT|>
