Let G be a graph. A path P = v_1, e_1, v_2, e_2, . . . , v_k in G is induced if for all i, j {1, . . . , k}, we have that {v_i, v_j } E(G) if and only if |i j| = 1. Let u, v V (G). True or false: if there is a path from u to v then there is an induced path from u to v. If true, give a sentence of explanation. If false, provide a counterexample