QUESTION 6 Let G = (V, E) be a graph where: V = {0, b, c, d, e, f} E = {le, a),(a, b). (b, c), (d), (d. e) (e. s. C. d)} Fill in the blanks below to produce true statements: G directed The shortest path from e to dis A walk from to cis:f. Gis (vertex) connected . The largest cycle in G is size- The smallest cycle in G is size- Hamiltonian. G