Consider the following statements:
(A) Any tree is 2-colorable
(B) A graph G has no cycles of even length if it is bipartite.
(C) A graph G is 2-colorable if is bipartite
(D) A graph G can be colored with d + 1 colors if d is the maximum degree of any vertex in the graph G.
(E) A graph G can be colored with O(log |v|) colors if it has O(|v|) edges.
Choose the correct answer from the options given below:
1
(C) and (E) are incorrect
2
(B) and (C) are incorrect
3
(B) and (E) are incorrect
4
(A) and (D) are incorrect