Quiz: Problem Recognition

Problem: 'Divide $n$ people into $2$ teams so that no two enemies are on the same team.' How do you model this?

1. A.Find the shortest path between enemies
2. B.Use dynamic programming on the enemy list
3. C.Build a graph where enemies are connected, check if it's bipartite
4. D.Sort people by number of enemies