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

G = nx.DiGraph([(0,1),(1,2),(2,3),(3,0),(2,4),(4,2)])
strongly_connected = nx.is_strongly_connected(G)
print('Is the graph strongly connected?', strongly_connected)
<|EOT|>
