Need help

5. (25 pts.) Circle True or False (no justification needed). a) Any connected graph on n vertices has n-1 edges. True False b) Chromatic number of a graph is always the minimum degree + 1. True False c) The longest path in a direted acyclic graph can be found in 0( n + m). True False d) If the post order traversal of two binary trees are identical, then the trees are identi- cal. Two binary trees are identical, if they have the same shape and the same contents True False e) BFS traversal can be performed on both directed and undirected graphs. True False 6. (10 pts.) Let G = (V. E) be a graph. What is the time complexity of computing minimum degree of G: a) If G is represented in its Adj. list. b) If G is represented in its Adj. matrix. 2/3 7. (10 pts.) Let G = (VE) be an undirected graph. Describe an algorithm that finds if G has a Cycle or not. What is the time complexity of the algorithm