Recall from HW 3 what it means for a graph to be bipartite. Use proof by contradiction to prove the following: Let G = (V. E) be a graph. 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 A B is logically equivalent to AVB