Given a graph G = (V, E) and integer k, we say that G k- Length-Cycle, if G has a simple cycle with k or more edges. Show that k-Length-Cycle problem is NP-Complete. Assume that HAMILTONCY- CLE, SAT, 3CNF-SAT and 3-COLOR are all known to be NP-Complete.