Problem 3: (26 points) The following statements are correct or not. If yes, explain why. If not, give a counterexample. 1. If an n vertices graph G has at least n edges, then it has a cycle. 2. In any tree with n vertices, the number of nodes with degree 8 or more is at most (n1)/4