(a) Design an algorithm that given a graph G, decides whether G is a tree. Prove that your algorithm is correct and that it runs in polynomial time