II. Given directed graph G2 in Figure 2, use Topological sorting on the following Directed Acyclic Graph (DAG) to create a linear ordering of vertices. During the algorithm, and when you are adding the nodes to the processing queue, add the nodes in lexicographical order. You only need to show the value in the TopologicalOrder array (see the slides) N G F B D C H E A I K L M TopologicalOrder 0 1 2 3 4 Figure 2. Graph G2 50 J 7 8 9 10 11 12 13 14