<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(1, 2), (1, 3), (2, 3), (2, 4), (3, 4)], can you compute the square clustering coefficient for its nodes using NetworkX?
### Response:
import networkx as nx

# Create a graph instance
G = nx.Graph()

# Add some edges
g.add_edges_from([(1, 2), (1, 3), (2, 3), (2, 4), (3, 4)])

# Compute square clustering
square_clust = nx.square_clustering(G)

# print the square clustering coefficients
for node, clust in square_clust.items():
    print(f'Node {node}: {clust}')
<|EOT|>
