Question 1 0 / 10 pts Consider a graph with the following adjacency list representation: A: [B,H] B: (A,C,E,G] C: [B,D] D: [C,E] E: [D,B,F] F: [E,G,H] G: [B,F] H: [A,F] Which of the following claims is correct? 1. It is acyclic 2. It is bipartite because it has an even length cycle 3. It is bipartite because it has an odd length cycle 4. It is not bipartite because it has an even length cycle 5. It is not bipartite because it has an odd length cycle 6. It is undirected