A graph is bipartite iff it is 2-colorable. In other words, a graph G = (V, E) is bipartite if its vertex set V can be partitioned into two sets V1 and V2 such that each edge in the graph has one endpoint in V1 and the other in V2. Prove that if a graph is bipartite then it has no odd cycles.