6 points A graph G-VE) is bipartite if its vertices can be partitioned into two subsets V AU 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