Run the strongly connected components $($SCCs$)$ algorithm on the following directed graphs $G.$ When doing DFS on $G^R($the reverse graph$)$: whenever there is a choice of vertices to explore, always pick the one that is alphabetically first.

Graph $($a$)$

In each case, answer the following questions:

$($a$)$ In what order are the strongly connected components $($SCCs$)$ found?

$($b$)$ Which are source SCCs and which are sink SCCs$?$

$($c$)$ Draw the "metagraph" $($each meta$-$node is an SCC of $G).$

$($d$)$ What is the minimum number of edges you must add to this graph to make it strongly connected?