3. a) [2pts] Draw the DAG D having the following vertex set V and edge set E. V 0,1,2,3,4,5,6,7,8,9 b) [8pts) Show the action of the topological sorting algorithm based on DFT for the DAG given in b). Show action of stack and how nodes are added to the list that stores nodes in topological order. When you have a choice always choose smallest labeled node first.