You are given a DAG. How would you check in linear time if the DAG includes a Hamiltonian path, i.e., a (directed) path that traverses every vertex exactly once?

You are given a DAG. How would you check in linear time if the DAG includes a Hamiltonian path, i.e., a (directed) path that traverses every vertex exactly once? Note 1: Please provide a detailed description of your solution in plain English or in pseudocode. Note 2: You are also allowed to use BFS and DFS as blackbox algorithms (you do not need to explain how it works if you use it) so long as you detail the inputs and outputs to the algorithms as well as any modifications you make