(a) Let G? be Q?, the 4-dimensional hypercube, G? be the complement graph of G?, and G? be the graph on the right. Which of the graphs G?, G?, G? have an Euler circuit? Euler trail? (Answers alone have no credit) vertices (b) If F is a forest with 100 leaves and 5 trees, then how many edges does it have? (c) Suppose G is a loop-free graph with degree sequence 4, 3, 3, 3, 3, 3, 3, 2, 2. Show that the complement graph \(\bar{G}\) has a Hamiltonian cycle.