1. Given a DAG, write a linear-time program (Java ) that determine whether there is a directed path that visits each vertex exactly once.

Solution: Compute a topological sort and check if there is an edge between each consecutive pair of vertices in the topological order.

include all imports and code execution. typed out please, and give comments next to each line