二、 Only simple graphs are considered in this problem.
(c) Let G be a graph with 5 vertices. Prove that if every vertex of G has degree 2, then G must be a cycle.