After running depth-first search on a directed graph G, is it necessarily true that v.f > u.f if vertex v is a descendent of vertex u? Explain your answer. (b) Is it true that if a directed graph G contains a path from u to v, then a depth-first search must necessarily result in v.d < u.f? Explain your answer.