<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with the edge set [(0, 1), (1, 2), (2, 3), (3, 0), (2, 4), (4, 2)], can you use the 'is_strongly_connected' function to determine if the graph is strongly connected?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()
# Add edges
G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0), (2, 4), (4, 2)])
# Check if the graph is strongly connected
is_connected = nx.is_strongly_connected(G)
print('Graph is strongly connected:', is_connected)
<|EOT|>
