Directed acyclic graphs

Select all statements that are true.

Every directed graph that has a node with no incoming edges is a DAG.

In any DAG $G,$ if $(u,v)$ is an edge of $G,$ then $DFS(v)$ will never discover $u.$

For every DAG $G,$ for any nodes $u$ and $v$ of $G,$ there exists at most one path from $u$ to $v$ in $G.$

Every DAG has at least one node with no outgoing edges.