Let G = (V, E) be a directed acyclic graph. Explain how this algorithm for topologically sorting the vertices of G can be implemented such that its running time is 0(V+ E): Set k=1. While the graph is non-empty: - Find a vertex v of indegree zero. - Assign the number k to v. - Remove v from the graph. Increase k by one