<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edge set [(1, 2), (2, 3), (1, 3), (3, 4), (4, 5), (3, 5), (1, 4)], can you compute the 3-truss of the graph using NetworkX? The 3-truss is the maximal induced subgraph where each edge is part of at least one triangle.
### Response:
import networkx as nx

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

# Compute the 3-truss of the graph
k = 3
truss = nx.k_truss(G, k)

print('Nodes in the 3-truss:', truss.nodes())
print('Edges in the 3-truss:', truss.edges())
<|EOT|>
