Problem 4. Trace the execution of TopologicalSort algorithm on the following graph. To review, here is the pseudo-code for the algorithm: Algorithm TopologicalSort(G) Input: A digraph G with n vertices Output: A topological ordering v1, v2, ..., Vn of G Let Q be an initially empty queue for each vertex u in G do Let incounter(u) be the in-degree of u if incounter(u) = 0 then Q.enqueue(u) while ! Q.isEmpty)) do u ? Q.dequeue() Let u be vertex number i in the topological ordering for each outgoing edge (u, w) of u do incounter(w) incounter(w) -1 if incounterw0 then Q.enqueue(w)