Modify the Breadth-first Search (BFS) algorithm so that it can count the number of connected components1 in any given undirected unweighted graph G = (V, E). You can start with the BFS pseudocode in the slides and create a new modified version BFS COMP(V,E) that takes as input the graph and returns the number of connected components. What is the running time of your algorithm?

n BES(V, E,s): for each vertex v E V {S} V.state = unvisited, v. dist = co, v.pred = null s.state = visited, s. dist = 0, s. pred = null Set queue Q = null ENQUEUE(Q,s) while Q # null v = DEQUEUE(Q) for each u Adj[v] if u. state == unvisited u.state = visited u.dist = v.dist + 1 u.pred = V ENQUEUE(Q, U) v.state = complete