Let G be a directed graph possibly with positive edge length. Let v v2 + v3 + v4 be one shortest path from vị to v4. Let vz + v4 + V5 → V6 be one shortest path from v3 to v6. Which one of the...

Extracted text: Let G be a directed graph possibly with positive edge length. Let v v2 + v3 + v4 be one shortest path from vị to v4. Let vz + v4 + V5 → V6 be one shortest path from v3 to v6. Which one of the following is NOT true? distance(v, v3) + distance(vs, v6) = distance(v1, vs). O The path v2 - U3 + v4 is one shortest path from vz to va. O The path v3 - v4 + U5 is one shortest path from vs to v5. O distance(v1, v4) 2 distance(v2, v3). Question 2 Suppose that after running DFS-with-timing on a directed graph G, the [pre, post] values for u and v are (3, 10] and [4, 5] respectively. Which one of the following is true? u and v must be in the same connected component. none of the others is true. v can reach u u and v must be not in the same connected component. u can reach v