Exercise 4 (2 pts). Consider the following decision problem: Given a graph G and an edge e in it, determine whether G has a cycle containing e. Is this problem in P? Yes, no, unknown? Justify your answer (if your answer is yes, briefly describe a polynomial-time algorithm).