Given a directed Graph find a node in the graph such that if we start a dfs from that node we can reach maximum number of nodes.

For Example :
In this Graph the possible ans would be 1, 0 or 2.