Suppose that the strongly$-$connected components algorithm discussed in class is run on the graph. Any time an arbitrary choice of which vertex to consider next needs to be made, the vertex from among the possible choices that comes earlier in the alphabet is chosen. $($Be sure that you understand all the ways in which the algorithm makes arbitrary choices. The algorithm does two depth$-$first searches, each of which makes some arbitrary choices. Those arbitrary choices should always favor the alphabetically earlier vertex. For example, if you have a choice between vertex A and vertex B$,$ choose vertex A because it comes earlier in the alphabet.$)$