Let G be a simple undirected graph with n vertices and m edges, where n 3. Prove or disprove the following statement: "If every vertex in G has degree at least n/2, then G must contain a cycle."