<｜begin▁of▁sentence｜>### Instruction:
Given a barbell graph created with `nx.barbell_graph(10, 0)`, is the graph 1-edge-connected and is it 2-edge-connected? Use the `is_k_edge_connected` function from NetworkX to find out.
### Response:
import networkx as nx

# Create a barbell graph
G = nx.barbell_graph(10, 0)

# Check if the graph is 1-edge-connected
is_1_edge_connected = nx.is_k_edge_connected(G, k=1)
print('Is the graph 1-edge-connected?', is_1_edge_connected)

# Check if the graph is 2-edge-connected
is_2_edge_connected = nx.is_k_edge_connected(G, k=2)
print('Is the graph 2-edge-connected?', is_2_edge_connected)
<|EOT|>
