In what order are the SCCs found? Which are the source and sink SCCs? Draw the metagraph of SCCs. What is the minimum number of edges you need to add to make the graph strongly connected?

please help with this multipart questio

Apply Tarjian's algorithm to compute the strongly connected components (SCCs) in the following graph. Whenever there is a choice of nodes to explore, pick the one that is first alphabetically. - In what order are the SCCs found? - Which are the source and sink SCCs? - Draw the "metagraph" of SCCs. - What is the minimum number of edges you need to add to make the graph strongly connected