Problem 3: Given a tree T with n vertices. Give an O(n) time algorithm that finds a vertex v such that all connected components of T - (tree T removing vertex v and all the edges connected to v) has at most n/2 vertices. Justify the running time bound of your algorithm. (Partial credits will be given for a polynomial time algorithm.)