please explain clearly.

(c) [20 points] Let G = (V,E) be a directed, acyclic graph. Give an efficient algorithm, to deternine if there is a path in G that traverses each node exactly once. Analyze the runing time and prove the correctness of your algorithm