Which of the statements is true for arbitrary digraphs G and vertices u$,$ v$,$ when running DFS on G$?$

Which of the statements is true for arbitrary digraphs G and vertices u$,$ v$,$ when running DFS on G$?$

If u is finished after v$,$ then there is a path from u to v$.$

If u was discovered before v$,$ but finished after v$,$ then there is a path from u to v$.$

If there is a path from v to u$,$ then v is discovered before u$.$

If there is a path from u to v$,$ then u always finishes after v finishes.