Let G be a directed graph. The problem is to decide whether G has a rooted tree such that there is a directed path from the root to every other vertex in the graph. Write an efficient algorithm for the given problem, briefly describe why it is a correct algorithm, and analyze the time complexity. If you cannot find any polynomial-time algorithm, then give a backtracking algorithm.