This is question and answer below. I need you to check that.

12. 6 points A graph G (V,E) is bipartite if its vertices can be partitioned into two subsets V U B such that all edges connect only vertices between the two sets (no two edges in the same set are connected) (a) Prove or disprove: If a graph G is bipartite, then G is a tree. (b) Prove or disprove: If a graph G is a tree, then it is bipartite