Let G = (V, E) be a graph with finitely many vertices. Prove the following statements.

Problem 3 (2+3 marks). Let G-(V, E) be a graph with finitely many vertices. Prove the following statements 1. If G has a cycle, then G has no topological ordering. 2. If G has no topological ordering, then G has a cycle