A directed acyclic graph with 6 vertices and 5 directed edges has the adjacency list representation: 0: 1, 3 1: 2 2: 3: 2 4: 5 5 Here is a graphical representation of the same DAG: 0------>1 | | | | | | v v 3------>2 4------>5 Give the topological order of the vertices that results from the DFS-based topological sort algorithm. Perform the first DFS from vertex 0. 

Question 2 options:

	0 1 2 3 4 5
	0 1 3 2 4 5
	4 0 1 3 2 5
	4 5 0 1 2 3
	4 5 0 3 1 2