The EULER CYCLE problem is defined as follows: given an undirected graph G, does it have a cycle that uses every edge exactly once? (a) Prove that EULER CYCLE lessthanorequalto p HAMILTONIAN CYCLE. (b) One of your classmates claims to have found a polynomial-time algorithm that solves EULER CYCLE. If this is true, what implications would this have for HAMILTONIAN CYCLE