<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with the edge set [(0, 3), (1, 2), (2, 3), (3, 0), (3, 1)], can you check if the graph is Eulerian using NetworkX?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph([(0, 3), (1, 2), (2, 3), (3, 0), (3, 1)])

# Check if the graph is Eulerian
is_euler = nx.is_eulerian(G)

print('Is the graph Eulerian?', is_euler)
<|EOT|>
