Exercise 5 (2 pts). A tree is a connected graph that has no cycle. Consider the following decision problem: Given a graph G, determine whether G is a tree. Is this problem in P? Yes, no, unknown? Justify your answer (if your answer is yes, briefly describe a polynomial-time algorithm).