Please provide step to step solution for both. Thank you

2. Give the order in which DFS finishes visiting each vertex in the following DAG. This is called the postorder. (Iterate through the vertices incident from v in increasing order.) 2 ? . 0 3. Use the gestorder from the previous question to topologically sort the DAG. topological order