Choose a graphG-(V, E) and a vertex u in G. Define D(x, y) to be the distance from z to y in G. Further define the sets Which of the following is false? OFor every G and u, no vertex in G2 is adjacent to a vertex in Go. For every G and u, every vertex in Gy is adjacent to at least one vertex in Gj ifor j 2 1. For every G and u, every vertex in Gy is adjacent to at least one vertex in Gjti for j2 1 It is possible for two vertices in Gj to be adjacent to each other