<｜begin▁of▁sentence｜>### Instruction:
Given a sequence [3, 3, 2, 2, 2], can you use the is_graphical function from NetworkX to determine whether it is a valid degree sequence for some undirected graph, without loops or multiple edges?
### Response:
from networkx import is_graphical

# Example usage
# Check if the sequence can be a degree sequence of an undirected graph
sequence = [3, 3, 2, 2, 2]
can_be_graphical = is_graphical(sequence)

print(f'Can the sequence be a degree sequence of an undirected graph? {can_be_graphical}')
<|EOT|>
