Given a graph G with n vertices, where n is even, prove that if every vertex has degree n/2 1, then G must contain a 3-cycle (a clique of size 3). A 3-cycle is a set of 3 vertices, a, b, c such that ab is an edge, bc is an edge and ac is an edge