<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge set [(1, 2), (2, 3), (3, 4), (4, 1), (1, 5), (2, 5)], can you find the asteroidal triple by using the find_asteroidal_triple API from NetworkX?
### Response:
import networkx as nx
from networkx.algorithms.asteroidal import find_asteroidal_triple

# Create a graph
G = nx.Graph()

# Add edges to the graph (nodes are added automatically)
edges = [(1, 2), (2, 3), (3, 4), (4, 1), (1, 5), (2, 5)]
G.add_edges_from(edges)

# Try to find an asteroidal triple
triple = find_asteroidal_triple(G)

# Print the result
print(triple)
<|EOT|>
