<｜begin▁of▁sentence｜>### Instruction:
Given a barbell graph created using NetworkX's `barbell_graph` function with parameters 10 and 0, which generates a graph consisting of two complete graphs K_10 connected by a single edge, can you determine if the graph is k-edge connected for k=1 and k=2 using the `is_k_edge_connected` function?
### Response:
import networkx as nx

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

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

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