3. (20 pts) from HW 3 what it means for a graph to be bipartite. Let G- (V, E) be some graph. Use proof by contradiction to prove the following statement: G is bipartite => G contains no cycles of odd length Hint: first draw a few bipartite graphs to convince yourself this is true, and remember that AB is logically equivalent to -AVB