Correct : 2

A graph is bipartite if its vertex set can be partitioned into two disjoint sets, say V₁ and V₂, such that every edge connects a vertex in V₁ to a vertex in V₂. No edges exist between vertices within the same set.

2. Determining the Chromatic Number (χ(G)):
• By definition, all vertices within V₁ are completely independent of each other (not adjacent). Therefore, every vertex in V₁ can safely share the exact same color (e.g., Color 1).
• Similarly, all vertices within V₂ are independent of each other and can share a different color (e.g., Color 2).
• Since every edge in the graph only goes between V₁ and V₂, no two adjacent vertices will ever share the same color.

3. Conclusion:
Any bipartite graph containing at least one edge can be properly colored using exactly 2 colors. Therefore, its chromatic number is 2.