1. Let G be a directed acyclic graph (DAG) with n vertices and m edges. Give an O(n + m)-time algorithm, that takes as input an ordering of the n vertices of G, and checks whether or not this ordering is a topological sorting for G.