a) Show how we can use the depth-first search algorithm we introduced in class to identify the connected components of an undirected graph G. More precisely, show how to modify depth-first search algorithm so that it assigns to each vertex v an integer label v.cc between 1 and k, where k is the number of connected components of G, such that u.cc v.cc if and only if u and v are in the same connected component. b) Argue which graph search strategy is better for each of the following applications: (you have to reason for your choice) 1. 2. 3. Crawling a network of web sites with a goal of indexing pages content. Discovering paths between separate locations in a road map. Given a location, find neighboring locations of distance k in a road map