Part one of 2 part question. Posting second part separately. No additional information needed to answer this part by it self

All graphs are simple in this problem, unless otherwise stated. 1. Any tree is bipartite. O True O False 2. Any graph G = (V, E) with |E| > [V| is connected, True OFalse 3. Every graph that is vertex-colorable with d colors has max degree d - 1. O True False 4. Any cycle can be edge colored with 2 colors. (Recall edge coloring is a coloring of edges so that any pair of edges incident to the same vertex have different colors.) True O False