Run the strongly connected components algorithm on the

following directed graphs $G.$ When doing DFS on $G^{\text{r}\text{e}\text{v}}$ : whenever there is a choice

of vertices to explore, always pick the one that is numerically first.

Then answer the following questions:

In what order are the strongly connected components found?

What are the source SCCs and what are the sink SCCs$?$

Draw the graph whose nodes are the SCCs$.$

What is the minimum number of edges you have to draw to make this graph

strongly connected?