Quiz: Bipartite Basics

A graph is bipartite if you can split its nodes into two sets where every edge connects nodes from different sets. Which graph is NOT bipartite?

1. A.A square (cycle of $4$ nodes)
2. B.A triangle (cycle of $3$ nodes)
3. C.A path graph with $5$ nodes
4. D.A tree with $10$ nodes