Prove that two nodes u and v are in the same strongly connected component of a directed graph G if and only if any DFS tree of G, there exists a node t such that (1) both u and v are descendants of t, (2) both u and v have paths to t, and (3) neither u nor v has a path to a proper ancestor of t.