6. (5 marks) Draw two distinct graphs G1 and G2 on 7 vertices (a, b, c, d, e, f, g} such that (a) a depth-first search starting at a of G visits the vertices of G in the same order as a breadth-first search starting at a of G1, AND (b) a depth-first search starting at a of G2 visits the vertices of G2 in the same order as a breadth-first search starting at a of G2.