Given a directed graph G = (V, E) a vertex v is called dominating node if there is a path from v to every other vertex in G. Give an O(m + n) algorithm that gets a directed graph (as adjacency list) and computes a dominating node, if exists