Prove using induction that for every DAG G with n > 1 vertices we can find an ordering of the vertices such that directed edges all go from a vertex that comes earlier in the order to a vertex that comes later in the order. D