1. (10 points) You run the strongly connected components algorithm on the following graph. Assume that all tie are broken alphabetically (in DFS, for instance). Show th along with all relevant work. Show the final underlying component graph. The graph is given in adjacency list format. e components you get, in the order you get them, b: f e:(h d: fe.g) e: (e, h) f : (b, dy 9: (b, ch h: (e First DFS discovery/finish values:
OR
OR