<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(0, 1), (1, 2), (1, 3), (1, 4), (3, 4), (2, 5)], compute the 1-crust of the graph using NetworkX, which involves removing the edges of the 1-core and any isolated nodes resulting from this operation.
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(0, 1), (1, 2), (1, 3), (1, 4), (3, 4), (2, 5)])

# Compute the 1-crust of the graph
k = 1
crust = nx.k_crust(G, k)

print('Nodes:', list(crust.nodes()))
print('Edges:', list(crust.edges()))
<|EOT|>
