_{For a graph, n and m denote number of vertices and edges respectively. 1. (15 pts.) Write the pseudo code for Depth First Search of G, provided the Adjacency list is used.}

_{2. (20 pts.) Let G = (V,E ) be a graph. Outline an algorithm to determine if G is connected using BFS. What is the time complexity, if G is represented in Adjacency list format.}

_{1 3. (10 pts.) What is the chromatic number of a Cycle on n => 3 vertices. a) If n is odd. b) If n is even.}

_{4. (10 pts.) Solve T(n) = 3 T(n/3 ) + n , T(1) = 1. You can assume n = 3k.}