Give an ecient algorithm that takes as input a directed graph G and determines whether there is a vertex from which all other vertices are reachable. Prove your algorithm is correct and analyze its running time. Faster (in big-O notation) and correct is worth more credit. (Note that the input graph G may not be acyclic.)