Recall that a tree is a connected acyclic graph. Given a graph G = (V, E) with n vertices, design an O(n) time algorithm to determine if G is a tree or not. You can assume that the graph is given by its adjacency list.