Homework 2.10 Recall that in the SCC algorithm the leader of an SCC is the first vertex in that SCC to be discovered by a depth-first search. Explain how the White Path Theorem and the Nesting of Descendant Intervals Lemma imply that each SCC has the same leader in the first DFS (on all of G) and the second DFS. Homework 2.10 Recall that in the SCC algorithm the leader of an SCC is the first vertex in that SCC to be discovered by a depth-first search. Explain how the White Path Theorem and the Nesting of Descendant Intervals Lemma imply that each SCC has the same leader in the first DFS (on all of G) and the second DFS