1. (10 points) You run the strongly connected components algorithm on the following graph. Assume that all ties are broken alphabetically (in DFS, for instance). Show the components you get, in the order you get the along with all relevant work. Show the final underlying component graph. The graph is given in adjacency matrix format