Find an efficient algorithm to determine whether or not a given graph G contains a 4-cycle. What is the asymptotic runtime of this algorithm? You should attempt to do better than the trivial algorithm of simply checking all quadruples v1, v2, v3, v4 of vertices.