Q)a)(T/F) Given a directed graph G = (V,E), the number of DFS-tree edges depends on the number of DFS-trees in the DFS forest. However, it is upper bounded by |V|-1.

b)(T/F) If a directed graph G contains a path from u to v, and if u.d < v.d in a depth-first search of G, then v is a descendant of u in the depth-first forest produced.